Finding a Polytope from Its Graph in Polynomial Time

DOI10.1007/978-3-540-72792-7_6zbMath1136.52308OpenAlexW2107006807MaRDI QIDQ5429258

Eric J. Friedman

Publication date: 29 November 2007

Published in: Integer Programming and Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-72792-7_6

Mathematics Subject Classification ID

Computational aspects related to convexity (52B55) Abstract computational complexity for mathematical programming problems (90C60) Linear programming (90C05)

This page was built for publication: Finding a Polytope from Its Graph in Polynomial Time