A Tight Lower Bound on the Size of Visibility Graphs.
Xiaojun ShenHerbert EdelsbrunnerPublished in: Inf. Process. Lett. (1987)
Keyphrases
- lower bound
- upper bound
- worst case
- branch and bound algorithm
- running times
- branch and bound
- objective function
- np hard
- lower bounding
- optimal solution
- maximum clique
- maximal cliques
- lower and upper bounds
- pruning power
- constant factor
- graph matching
- graph theory
- graph structure
- graph databases
- random graphs
- computational complexity
- neural network
- uniform random
- subgraph isomorphism
- graph mining
- bipartite graph
- graphical models
- genetic algorithm