k-Chordal Graphs: From Cops and Robber to Compact Routing via Treewidth.
Adrian KosowskiBi LiNicolas NisseKarol SuchanPublished in: ICALP (2) (2012)
Keyphrases
- bounded treewidth
- undirected graph
- search space
- np complete
- graph structure
- boolean functions
- graph matching
- upper bound
- routing algorithm
- network topology
- graph theoretic
- constraint graph
- space complexity
- graph mining
- routing problem
- directed graph
- routing protocol
- knowledge sharing
- discrete random variables
- tree decompositions
- shortest path
- random graphs
- mobile ad hoc networks
- graph representation
- graph model
- weighted graph
- search algorithm
- decision problems
- graph theory