scientific article; zbMATH DE number 1045607

DOI10.1002/(SICI)1097-0037(199705)29:3%3C151::AID-NET3%3E3.0.CO;2-GMaRDI QIDQ4347282zbMATH OpenFDO

Authors L. Leslie Gardner, Donald K. Wagner, Collette R. Coullard

Publication date 8 December 1997

Full work available at URL https://doi.org/10.1002/(SICI)1097-0037(199705)29:3%3C151::AID-NET3%3E3.0.CO;2-G

zbMATH Keywords

3-separationsdecompositiongraph-optimization problemsminimum-weight-cycle problemNP-hardpolynomial-time algorithm

Mathematics Subject Classification ID

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

Recommendations

• On cycle cones and polyhedra
• Automata, Languages and Programming
• Minimum cycle bases of weighted outerplanar graphs
• Minimum cycle bases of weighted outerplanar graphs
• On cycle cones and polyhedra

Cited in

(2)

• On cycle cones and polyhedra
• On cycle cones and polyhedra

This page was built for publication:

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