Fixed-Treewidth-Efficient Algorithms for Edge-Deletion to Interval Graph Classes.
Toshiki SaitohRyo YoshinakaHans L. BodlaenderPublished in: WALCOM (2021)
Keyphrases
- weighted graph
- bounded treewidth
- graph structure
- undirected graph
- upper bound
- disjoint paths
- equivalence classes
- graph model
- search space
- edge weights
- space complexity
- directed acyclic graph
- graph theory
- connected components
- edge detection
- graph representation
- bipartite graph
- vertex set
- structured data
- boolean functions
- spanning tree
- directed graph
- bounded degree
- edge information
- graph theoretic
- np complete
- multi class
- strongly connected
- multiscale