Series-parallel graphs are windy postman perfect

DOI10.1016/J.DISC.2007.07.062MaRDI QIDQ2476276zbMATH OpenOpenAlexFDO

Authors F. J. Zaragoza Martínez

Publication date 18 March 2008

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.disc.2007.07.062

zbMATH Keywords

integral polyhedraseries-parallel graphswindy postman problem

Mathematics Subject Classification ID

Perfect graphs (05C17) Structural characterization of families of graphs (05C75) Graph algorithms (graph-theoretic aspects) (05C85) Combinatorial optimization (90C27) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Recommendations

• The windy postman problem on series-parallel graphs
• On the windy postman problem on Eulerian graphs
• On the windy postman problem
• A cutting plane algorithm for the windy postman problem
• Algorithms for the windy postman problem

Cites work

• A cutting plane algorithm for the windy postman problem
• scientific article; zbMATH DE number 4068590 (Why is no real title available?)
• Matching, Euler tours and the Chinese postman
• Minimum cycle cover and Chinese postman problems on mixed graphs with bounded tree-width
• On the windy postman problem
• On the windy postman problem on Eulerian graphs
• The Chinese Postman Problem for Mixed Networks
• The ellipsoid method and its consequences in combinatorial optimization
• Topology of series-parallel networks

Cited in

(6)

• On the windy postman problem on Eulerian graphs
• Postman problems on series-parallel mixed graphs
• New results on the windy postman problem
• The windy postman problem on series-parallel graphs
• scientific article; zbMATH DE number 4185647 (Why is no real title available?)
• Plowing with precedence in polynomial time

Describes a project that uses

Uses Software

• PORTA

This page was built for publication: Series-parallel graphs are windy postman perfect

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