A new lower bound on the maximum number of plane graphs using production matrices.
Clemens HuemerAlexander PilzRodrigo I. SilveiraPublished in: CoRR (2019)
Keyphrases
- maximum number
- lower bound
- upper bound
- branch and bound algorithm
- kronecker product
- objective function
- lower and upper bounds
- three dimensional
- projection matrix
- graph theory
- graph matching
- np hard
- worst case
- singular value decomposition
- branch and bound
- production system
- eigenvalues and eigenvectors
- sufficiently accurate
- lower bounding
- graph databases
- graph theoretic
- graph representation
- graph partitioning
- dynamic programming
- undirected graph
- production cost
- concept class
- graph mining
- graph structure
- fundamental matrices
- random walk
- bipartite graph
- learning algorithm