An approximation algorithm for maximum P₃-packing in subcubic graphs
From MaRDI portal
Publication:845730
Recommendations
- Packing three-vertex paths in a subcubic graph
- Packing three-vertex paths in 2-connected cubic graphs.
- On maximum \(P_3\)-packing in claw-free subcubic graphs
- An \(O^*(1.4366^n)\)-time exact algorithm for maximum \(P_2\)-packing in cubic graphs
- The P k Partition Problem and Related Problems in Bipartite Graphs
Cites work
- An approximation algorithm for maximum packing of 3-edge paths
- Approximation algorithms for the test cover problem
- Chain packing in graphs
- Factors and factorizations of graphs—a survey
- Generalized planar matching
- How many disjoint 2-edge paths must a cubic graph have?
- On gallery watchmen in grids
- On packing 3-vertex paths in a graph
- On the Complexity of General Graph Factor Problems
- Parallel Processing and Applied Mathematics
- Path factors in cubic graphs
Cited in
(11)- Tighter bounds on the size of a maximum \(P_{3}\)-matching in a cubic graph
- Fixed-parameter algorithms for Vertex Cover \(P_3\)
- A local search algorithm for binary maximum 2-path partitioning
- On maximum \(P_3\)-packing in claw-free subcubic graphs
- An \(O^*(1.4366^n)\)-time exact algorithm for maximum \(P_2\)-packing in cubic graphs
- Packing three-vertex paths in 2-connected cubic graphs.
- Approximating Maximum Edge 2-Coloring in Simple Graphs Via Local Improvement
- Packing three-vertex paths in a subcubic graph
- Identifying path covers in graphs
- The maximum 4-vertex-path packing of a cubic graph covers at least two-thirds of its vertices
- An improved approximation algorithm for maximum edge 2-coloring in simple graphs
This page was built for publication: An approximation algorithm for maximum \(P_{3}\)-packing in subcubic graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q845730)
