Using ILP/SAT to Determine Pathwidth, Visibility Representations, and other Grid-Based Graph Drawings.
Therese C. BiedlThomas BläsiusBenjamin NiedermannMartin NöllenburgRoman PrutkinIgnaz RutterPublished in: Graph Drawing (2013)
Keyphrases
- bounded treewidth
- inductive logic programming
- random walk
- graph structure
- graph theory
- graph representation
- relational learning
- graph representations
- graph theoretic
- directed graph
- phase transition
- satisfiability problem
- directed acyclic graph
- vector representation
- engineering drawings
- search algorithm
- graphical representation
- propositional satisfiability
- graph partitioning
- search strategies
- orders of magnitude
- domain knowledge