Surviving Rates of Graphs with Bounded Treewidth for the Firefighter Problem.
Leizhen CaiYongxi ChengElad VerbinYuan ZhouPublished in: SIAM J. Discret. Math. (2010)
Keyphrases
- bounded treewidth
- np complete
- decision problems
- conjunctive queries
- highly parallelizable
- boolean functions
- tractable cases
- relational learning
- graph theoretic
- np hard
- integrity constraints
- bounded degree
- constraint satisfaction problems
- database systems
- database
- natural language
- training data
- metadata
- decision making
- databases