Login / Signup

Finding a Simple Polytope from Its Graph in Polynomial Time.

Eric J. Friedman
Published in: Discret. Comput. Geom. (2009)
Keyphrases
  • stable set
  • directed graph
  • random walk
  • graph theoretic
  • hamiltonian cycle
  • weighted graph
  • graph representation
  • graph search
  • strongly connected
  • min sum
  • polynomial time complexity
  • lattice points