29 citations · 34 across the 12 of their papers we have counts for
Showing 2001Show all
3 papers · 1 filter
math.CO2001
On the Expansion of Graphs of 0/1-Polytopes
Volker Kaibel
The edge expansion of a graph is the minimum quotient of the number of edges in a cut and the size of the smaller one among the two node sets separated by the cut. Bounding the edg…
math.CO2001
On the Complexity of Polytope Isomorphism Problems
Volker Kaibel, Alexander Schwartz
We show that the problem to decide whether two (convex) polytopes, given by their vertex-facet incidences, are combinatorially isomorphic is graph isomorphism complete, even for si…
math.MG2001
Computing the Face Lattice of a Polytope from its Vertex-Facet Incidences
Volker Kaibel, Marc E. Pfetsch
We give an algorithm that constructs the Hasse diagram of the face lattice of a convex polytope P from its vertex-facet incidences in time O(min{n,m}*a*f), where n is the number of…