A tight lower bound on the maximum genus of a simplicial graph.
Jianer ChenSaroja P. KanchiJonathan L. GrossPublished in: Discret. Math. (1996)
Keyphrases
- lower bound
- upper bound
- branch and bound algorithm
- branch and bound
- graph representation
- worst case
- constant factor
- np hard
- optimal solution
- objective function
- connected components
- directed graph
- random walk
- lower and upper bounds
- lower bounding
- graph structure
- graph theoretic
- bipartite graph
- graph theory
- graph matching
- graph structures
- integrality gap
- directed acyclic graph
- graph model
- spanning tree
- sample complexity
- weighted graph
- structured data
- graph construction
- linear programming
- special case
- sufficiently accurate
- betti numbers