A new lower bound on the maximum number of plane graphs using production matrices.
Clemens HuemerAlexander PilzRodrigo I. SilveiraPublished in: Comput. Geom. (2019)
Keyphrases
- maximum number
- lower bound
- upper bound
- branch and bound algorithm
- branch and bound
- three dimensional
- np hard
- worst case
- graph theory
- kronecker product
- singular value decomposition
- production system
- optimal solution
- sufficiently accurate
- lower and upper bounds
- graph model
- bipartite graph
- graph structure
- graph theoretic
- production cost
- lower bounding
- projection matrix
- eigenvalues and eigenvectors
- directed graph
- search algorithm
- graph partitioning
- graph representation
- graph matching