On the complexity of the disjoint paths problem

Saved in:
Bibliographic Details
Published inCombinatorica (Budapest. 1981) Vol. 13; no. 1; pp. 97 - 107
Main Authors Middendorf, Matthias, Pfeiffer, Frank
Format Journal Article
LanguageEnglish
Published Budapest Akadémiai KiadÓ 01.03.1993
Berlin Springer
Subjects
Combinatorics
Combinatorics. Ordered structures
Exact sciences and technology
Graph theory
Mathematics
Sciences and techniques of general use
Graph path
Planar graph
NP complete problem
Counterexample
Eulerian graph
Graph circuit
Polynomial time
Online AccessGet full text
ISSN0209-9683
1439-6912
DOI10.1007/BF01202792

Cover

More Information
ISSN:0209-9683
1439-6912
DOI:10.1007/BF01202792