On the Query Complexity of Testing Orientations for Being Eulerian
Attributed to:
The Centre for Discrete Mathematics and its Applications (DIMAP)
funded by
EPSRC
Abstract
No abstract provided
Bibliographic Information
Digital Object Identifier: http://dx.doi.org/10.1007/978-3-540-85363-3_32
Publication URI: http://dx.doi.org/10.1007/978-3-540-85363-3_32
Type: Book Chapter
Book Title: Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques (2008)
Page Reference: 402-415
ISBN: 978-3-540-85362-6