h-Quasi Planar Drawings of Bounded Treewidth Graphs in Linear Area.

Emilio Di Giacomo Walter Didimo Giuseppe Liotta Fabrizio Montecchiani

Published in: WG (2012)

Keyphrases

bounded treewidth
np complete
conjunctive queries
decision problems
highly parallelizable
line drawings
boolean functions
relational learning
fixed parameter tractable
graph theoretic
computational complexity
information retrieval
decision making
relational data
bounded degree