📣 Help Shape the Future of UKRI's Gateway to Research (GtR)

We're improving UKRI's Gateway to Research and are seeking your input! If you would be interested in being interviewed about the improvements we're making and to have your say about how we can make GtR more user-friendly, impactful, and effective for the Research and Innovation community, please email gateway@ukri.org.

The computational complexity of graph contractions II: Two tough polynomially solvable cases (2008)

First Author: Levin A

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.1002/net.20249

Publication URI: http://dx.doi.org/10.1002/net.20249

Type: Journal Article/Review

Parent Publication: Networks

Issue: 1