Bandwidth, expansion, treewidth, separators and universality for bounded-degree graphs.
Julia BöttcherKlaas Paul PruessmannAnusch TarazAndreas WürflPublished in: Eur. J. Comb. (2010)
Keyphrases
- bounded treewidth
- bounded degree
- np complete
- graph theoretic
- decision problems
- conjunctive queries
- relational learning
- cellular automata
- boolean functions
- information extraction
- np hard
- special case
- constraint graph
- data management
- decision makers
- computational complexity
- upper bound
- video streaming
- domain knowledge
- data model