Efficient Algorithms for Eulerian Extension

DOI10.1007/978-3-642-16926-7_11zbMath1309.68080MaRDI QIDQ3057616

Rolf Niedermeier, Mathias Weller, Frederic Dorn, Hannes Moser

Publication date: 16 November 2010

Published in: Graph Theoretic Concepts in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-16926-7_11

Mathematics Subject Classification ID

68Q25: Analysis of algorithms and problem complexity

68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)

05C85: Graph algorithms (graph-theoretic aspects)

05C45: Eulerian and Hamiltonian graphs