On cycle covers of graphs with bounded pathwidth

MaRDI QIDQ3144471zbMATH OpenFDO

Authors V. V. Lepin

Publication date 8 December 2012

zbMATH Keywords

space-efficient algorithmscycle cover problems

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• Algorithms for solving problems on graphs of bounded pathwidth
• Algorithms for finding biclique covers of graphs with bounded pathwidth
• Minimum cycle cover and Chinese postman problems on mixed graphs with bounded tree-width
• STACS 2005
• On Approximating Restricted Cycle Covers

Cited in

(5)

• Algorithms for solving problems on graphs of bounded pathwidth
• Algorithms for finding biclique covers of graphs with bounded pathwidth
• On Approximating Restricted Cycle Covers
• Resolvable coverings of 2-paths by cycles
• Bicyclic graphs with extremal cover cost

This page was built for publication: On cycle covers of graphs with bounded pathwidth

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3144471)