Pages that link to "Item:Q845730"
From MaRDI portal
The following pages link to An approximation algorithm for maximum \(P_{3}\)-packing in subcubic graphs (Q845730):
Displaying 6 items.
- Identifying path covers in graphs (Q396675) (← links)
- An improved approximation algorithm for maximum edge 2-coloring in simple graphs (Q935838) (← links)
- Tighter bounds on the size of a maximum \(P_{3}\)-matching in a cubic graph (Q1014835) (← links)
- Fixed-parameter algorithms for Vertex Cover \(P_3\) (Q1751145) (← links)
- A local search algorithm for binary maximum 2-path partitioning (Q1799391) (← links)
- Approximating Maximum Edge 2-Coloring in Simple Graphs Via Local Improvement (Q3511418) (← links)
