A Lower Bound on the Diameter of the Flip Graph.
Fabrizio FratiPublished in: Electron. J. Comb. (2017)
Keyphrases
- lower bound
- upper bound
- graph representation
- branch and bound algorithm
- objective function
- branch and bound
- graph theory
- random walk
- spanning tree
- average degree
- graph theoretic
- lower and upper bounds
- optimal solution
- structured data
- constant factor
- graph model
- weighted graph
- learning algorithm
- graph structure
- worst case
- np hard
- graph based algorithm
- sufficiently accurate
- graph matching
- sample complexity
- knn
- connected components
- lower bounding
- bipartite graph
- dependency graph
- polynomial approximation