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: CoRR (2013)
Keyphrases
- bounded treewidth
- graph representation
- inductive logic programming
- sat solvers
- vector representation
- graph structure
- search algorithm
- bipartite graph
- satisfiability problem
- graph theory
- topological map
- graph partitioning
- structured data
- np complete
- graph mining
- graph theoretic
- graph representations
- phase transition
- directed graph
- connected components
- random walk
- mobile robot
- domain knowledge
- weighted graph
- directed acyclic graph
- background knowledge
- constraint satisfaction problems
- information extraction
- computational complexity