k-Chordal Graphs: From Cops and Robber to Compact Routing via Treewidth.
Adrian KosowskiBi LiNicolas NisseKarol SuchanPublished in: Algorithmica (2015)
Keyphrases
- bounded treewidth
- undirected graph
- constraint graph
- np complete
- upper bound
- graph matching
- search space
- directed graph
- graph structure
- space complexity
- spanning tree
- routing algorithm
- graph mining
- graph model
- graph databases
- routing problem
- random walk
- graph representation
- graph theoretic
- series parallel
- path consistency
- graph partitioning
- discrete random variables
- tree decompositions
- constraint satisfaction problems
- random graphs
- network topology
- boolean functions
- weighted graph