Login / Signup
Partitioning a Graph into Highly Connected Subgraphs.
Valentin Borozan
Michael Ferrara
Shinya Fujita
Michitaka Furuya
Yannis Manoussakis
Narayanan Narayanan
Derrick Stolee
Published in:
J. Graph Theory (2016)
Keyphrases
</>
highly connected
graph properties
graph mining
graph databases
subgraph mining
random walk
subgraph isomorphism
data structure
graph data
partitioning algorithm
labeled graphs
bipartite graph
graph partitioning
maximum clique
frequent subgraph mining