An upper bound for the competition numbers of graphs.
Akira KamibeppuPublished in: Discret. Appl. Math. (2010)
Keyphrases
- upper bound
- lower bound
- worst case
- branch and bound
- branch and bound algorithm
- graph theory
- upper and lower bounds
- graph matching
- information systems
- international competition
- error probability
- labeled graphs
- series parallel
- graph representation
- graph mining
- np complete
- search algorithm
- data mining
- lower and upper bounds
- graph theoretic
- graph structure
- graph structures
- single item
- structured objects
- pattern recognition