On upper bound graphs whose complements are also upper bound graphs.
Hiroshi EraMorimasa TsuchiyaPublished in: Discret. Math. (1998)
Keyphrases
- upper bound
- lower bound
- worst case
- upper and lower bounds
- error probability
- branch and bound
- branch and bound algorithm
- graph theory
- lower and upper bounds
- pattern recognition
- graph theoretic
- directed graph
- random graphs
- graph partitioning
- dynamic graph
- single item
- structured objects
- real time
- graph databases
- generalization error
- graph matching
- combinatorial optimization
- structured data
- np hard
- pairwise
- optimal solution
- similarity measure