Computing Graph Distances Parameterized by Treewidth and Diameter.
Thore HusfeldtPublished in: IPEC (2016)
Keyphrases
- bounded treewidth
- graph structure
- tree decompositions
- upper bound
- distance measure
- random walk
- maximum distance
- search space
- bipartite graph
- graph theoretic
- homology generators
- connected components
- graph representation
- average degree
- boolean functions
- directed acyclic graph
- constraint graph
- vertex set
- graph theory
- spanning tree
- bayesian networks
- graph matching
- constraint satisfaction problems
- graphical models
- search algorithm