On the Size of Graphs That Admit Polyline Drawings with Few Bends and Crossing Angles.

Eyal Ackerman Radoslav Fulek Csaba D. Tóth

Published in: Graph Drawing (2010)

Keyphrases

maximal cliques
directed graph
database
graph databases
data sets
aspect ratio
graph matching
graph theoretic
structured objects
series parallel
bounded treewidth
graph representation
graph model
np hard
object recognition
computational complexity
case study
neural network