scientific article; zbMATH DE number 3628389

zbMATH Open0404.68053MaRDI QIDQ4190141FDOQ4190141

Authors: Mihalis Yannakakis, Christos Papadimitriou 

Publication date: 1979

Title of this publication is not available (Why is that?)

zbMATH Keywords

Travelling SalesmanMathematical ProgrammingMinimum Spanning TreeCombinatorial ComplexityMatching ProblemMatroid Intersection

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Combinatorial aspects of matroids and geometric lattices (05B35) Mathematical programming (90C99)

Cited In (1)

• Constructing full spanning trees for cubic graphs

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4190141)