Euler paths in series parallel graphs

DOI10.1145/380752.380806MaRDI QIDQ5175974zbMATH OpenOpenAlexFDO

Authors S. R. Kosaraju

Publication date 27 February 2015

Published in Proceedings of the thirty-third annual ACM symposium on Theory of computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/380752.380806

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• scientific article; zbMATH DE number 3922544
• scientific article; zbMATH DE number 4128845
• Exact counting of Euler tours for generalized series-parallel graphs
• Series parallel extensions of plane graphs to dual-Eulerian graphs
• Dual Eulerian Properties of Plane Multigraphs

Cites work

• A constant-factor approximation algorithm for the \(k\)-median problem (extended abstract)

Cited in

(4)

• scientific article; zbMATH DE number 3922544 (Why is no real title available?)
• Dual-Eulerian graphs. (Translated and adapted by Arjana Žitnik)
• Measuring the distance to series-parallelity by path expressions
• Series parallel extensions of plane graphs to dual-Eulerian graphs

This page was built for publication: Euler paths in series parallel graphs

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