Deletion to Scattered Graph Classes II - Improved FPT Algorithms for Deletion to Pairs of Graph Classes.
Ashwin JacobDiptapriyo MajumdarVenkatesh RamanPublished in: CoRR (2022)
Keyphrases
- graph theory
- equivalence classes
- graph representation
- random walk
- computational complexity
- computational cost
- minimum spanning tree
- directed graph
- graph search
- learning algorithm
- web graph
- graph construction
- structured data
- significant improvement
- maximum flow
- depth first search
- random graphs
- graph based algorithm
- bounded degree
- graph data
- edge weights
- graph partitioning
- weighted graph
- search algorithm
- graph theoretic
- graph mining
- directed acyclic graph
- bipartite graph
- graph matching
- graph structures
- frequent patterns
- maximum weight
- optimization problems
- maximum clique
- graph properties
- polynomial time complexity