Fixed-Treewidth-Efficient Algorithms for Edge-Deletion to Intersection Graph Classes.
Toshiki SaitohRyo YoshinakaHans L. BodlaenderPublished in: CoRR (2020)
Keyphrases
- weighted graph
- bounded treewidth
- graph structure
- undirected graph
- disjoint paths
- directed graph
- tractable classes
- edge weights
- graph theoretic
- graph theory
- search space
- edge detection
- graph representation
- graph model
- bounded degree
- equivalence classes
- edge detector
- upper bound
- spanning tree
- constraint graph
- np complete
- edge information
- graph databases
- space complexity
- graph partitioning
- graph mining
- approximation algorithms
- connected components
- random graphs
- constraint satisfaction problems
- optimal solution