On the Size of Planarly Connected Crossing Graphs.

Eyal Ackerman Balázs Keszegh Máté Vizer

Published in: Graph Drawing (2016)

Keyphrases

graph representation
graph matching
multiscale
graph theory
uniform random
neighborhood graph
graph theoretic
neural network
semi supervised
graph structure
computational complexity
search algorithm
bayesian networks
maximal cliques
bounded treewidth
maximum clique
information systems