On the size of planarly connected crossing graphs.

Eyal Ackerman Balázs Keszegh Máté Vizer

Published in: CoRR (2015)

Keyphrases

uniform random
maximum clique
maximal cliques
graph matching
graph representation
graph mining
graph clustering
small size
graph theoretic
graph databases
databases
bipartite graph
connected components
data structure
weighted graph
directed graph
pattern recognition
real world