Constructivity issues in graph algorithms

DOI10.1007/BFB0021088MaRDI QIDQ4594259zbMATH OpenOpenAlexFDO

Authors Michael R. Fellows, Michael A. Langston

Publication date 17 November 2017

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bfb0021088

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• Nonconstructive tools for proving polynomial-time decidability
• Constructive complexity
• On Well-Partial-Order Theory and Its Application to Combinatorial Problems of VLSI Design
• scientific article; zbMATH DE number 3917707
• scientific article; zbMATH DE number 140151

Cited in

(2)

• Constructive complexity
• Nonconstructive tools for proving polynomial-time decidability

This page was built for publication: Constructivity issues in graph algorithms

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