×
Papadimitriou, Christos H.; Yannakakis, Mihalis

The complexity of restricted spanning tree problems. (English) Zbl 0478.68068

J. Assoc. Comput. Mach. 29, 285-309 (1982).
Page: −5 −4 −3 −2 −1 ±0 +1 +2 +3 +4 +5 Show Scanned Page
scan of Zbl 0478.68068

Cited in 2 Reviews
Cited in 64 Documents

MSC:

68R10 Graph theory (including graph drawing) in computer science
68Q25 Analysis of algorithms and problem complexity
94C15 Applications of graph theory to circuits and networks

Keywords:

traveling salesman problem; network problems; NP-complete; polynomial algorithm; matching
Cite Review PDF
Full Text: DOI