Comparing Universal Covers in Polynomial Time (2009)
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/s00224-009-9200-z
Publication URI: http://dx.doi.org/10.1007/s00224-009-9200-z
Type: Journal Article/Review
Parent Publication: Theory of Computing Systems
Issue: 4
ISSN: 14324350 14330490