Comparing Universal Covers in Polynomial Time
Attributed to:
Exact algorithms for NP-hard problems
funded by
EPSRC
Abstract
No abstract provided
Bibliographic Information
Digital Object Identifier: http://dx.doi.org/10.1007/978-3-540-79709-8_18
Publication URI: http://dx.doi.org/10.1007/978-3-540-79709-8_18
Type: Book Chapter
Book Title: Computer Science - Theory and Applications (2008)
Page Reference: 158-167
ISBN: 978-3-540-79708-1
ISSN: 2731-5525