Fragkiskos D. Malliaros
1 indexed paper
Recent (6 mo)
1With code
0Influential cites
0Benchmarked
0Publications per year
126
Top categories
ML×1AI×1
Frequent co-authors
Research Timeline
2026
Scaling Higher-Order Graph Learning with Maximal Clique Complexes
This paper proposes a scalable topological learning framework for higher-order graph representation by introducing simplified and factored cellular Weisfeiler Leman tests and a novel random walk method for sampling maximal cliques.
Highlighted terms show continued research focus across papers