NC algorithms for partitioning sparse graphs into induced forests with an application
From MaRDI portal
Publication:6487991
DOI10.1007/BFB0015449zbMath1516.05208MaRDI QIDQ6487991
Publication date: 21 March 2023
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25) Density (toughness, etc.) (05C42)
Cites Work
- Unnamed Item
- Unnamed Item
- An approach to the subgraph homeomorphism problem
- The point-arboricity of a graph
- Homomorphism theorems for graphs
- Applications of a Planar Separator Theorem
- Approximation algorithms for NP-complete problems on planar graphs
- Node-and edge-deletion NP-complete problems
- The Point-Arboricity of Planar Graphs
This page was built for publication: NC algorithms for partitioning sparse graphs into induced forests with an application