Randomly Coloring Graphs of Logarithmically Bounded Pathwidth.
Shai VardiPublished in: APPROX-RANDOM (2018)
Keyphrases
- bounded treewidth
- np complete
- decision problems
- graph theory
- conjunctive queries
- graph matching
- objective function
- boolean functions
- multi objective
- graph theoretic
- randomly chosen
- series parallel
- directed graph
- bipartite graph
- graph databases
- graph representation
- relational learning
- random graphs
- data mining
- structured objects