ResearchTrend.AI
  • Papers
  • Communities
  • Events
  • Blog
  • Pricing
Papers
Communities
Social Events
Terms and Conditions
Pricing
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2025 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 1811.02089
  4. Cited By
Motif and Hypergraph Correlation Clustering

Motif and Hypergraph Correlation Clustering

5 November 2018
A. Mostayed
Gregory J. Puleo
O. Milenkovic
ArXiv (abs)PDFHTML

Papers citing "Motif and Hypergraph Correlation Clustering"

6 / 6 papers shown
Title
Correlation Clustering via Strong Triadic Closure Labeling: Fast
  Approximation Algorithms and Practical Lower Bounds
Correlation Clustering via Strong Triadic Closure Labeling: Fast Approximation Algorithms and Practical Lower Bounds
Nate Veldt
85
23
0
20 Nov 2021
You are AllSet: A Multiset Function Framework for Hypergraph Neural
  Networks
You are AllSet: A Multiset Function Framework for Hypergraph Neural Networks
Eli Chien
Chao Pan
Jianhao Peng
O. Milenkovic
GNN
120
133
0
24 Jun 2021
Distance Encoding: Design Provably More Powerful Neural Networks for
  Graph Representation Learning
Distance Encoding: Design Provably More Powerful Neural Networks for Graph Representation Learning
Pan Li
Yanbang Wang
Hongwei Wang
J. Leskovec
GNN
101
12
0
31 Aug 2020
Parameterized Correlation Clustering in Hypergraphs and Bipartite Graphs
Parameterized Correlation Clustering in Hypergraphs and Bipartite Graphs
Nate Veldt
Anthony Wirth
D. Gleich
56
4
0
21 Feb 2020
Clustering in graphs and hypergraphs with categorical edge labels
Clustering in graphs and hypergraphs with categorical edge labels
Ilya Amburg
Nate Veldt
Austin R. Benson
78
94
0
22 Oct 2019
Quadratic Decomposable Submodular Function Minimization: Theory and
  Practice (Computation and Analysis of PageRank over Hypergraphs)
Quadratic Decomposable Submodular Function Minimization: Theory and Practice (Computation and Analysis of PageRank over Hypergraphs)
Pan Li
Niao He
O. Milenkovic
111
26
0
26 Feb 2019
1