Complexity of Compatible Decompositions of Eulerian Graphs and Their Transformations

Jana Maxová, Jaroslav Nesetril. Complexity of Compatible Decompositions of Eulerian Graphs and Their Transformations. In Rolf H. Möhring, Rajeev Raman, editors, Algorithms - ESA 2002, 10th Annual European Symposium, Rome, Italy, September 17-21, 2002, Proceedings. Volume 2461 of Lecture Notes in Computer Science, pages 711-722, Springer, 2002. [doi]

Abstract

Abstract is missing.