An inductive construction of (2, 1)-tight graphs.
Anthony NixonJohn C. OwenPublished in: Contributions Discret. Math. (2014)
Keyphrases
- worst case
- concept learning
- lower bound
- inductive learning
- graph matching
- construction process
- graph theoretic
- upper bound
- machine learning
- knowledge representation
- pairwise
- graph theory
- computational complexity
- graph mining
- graph databases
- graph representation
- information systems
- rule learning
- data sets
- structured objects
- labeled graphs