90 citations · 194 across the 29 of their papers we have counts for
Showing cs.DSShow all
2 papers · 1 filter
cs.DS2019
Revisiting the Graph Isomorphism Problem with Semidefinite Programming
Giannis Nikolentzos, Michalis Vazirgiannis
It is well-known that the graph isomorphism problem can be posed as an equivalent problem of determining whether an auxiliary graph structure contains a clique of specific order. H…
cs.DS2016
K-clique-graphs for Dense Subgraph Discovery
G. Nikolentzos, P. Meladianos, Y. Stavrakas +1
Finding dense subgraphs in a graph is a fundamental graph mining task, with applications in several fields. Algorithms for identifying dense subgraphs are used in biology, in finan…