On the computational complexity of combinatorial flexibility problems

DOI10.1080/00207160903315516zbMath1279.90147OpenAlexW2055062144MaRDI QIDQ3066977

V. Leoni, Graciela L. Nasini

Publication date: 20 January 2011

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207160903315516

zbMATH Keywords

computational complexitycombinatorial problemsmatroidstest setsflexibility problems

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Abstract computational complexity for mathematical programming problems (90C60) Combinatorial optimization (90C27)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The directed subgraph homeomorphism problem
• Combinatorial flexibility problems and their computational complexity
• A note on shortest path, assignment, and transportation problems

This page was built for publication: On the computational complexity of combinatorial flexibility problems