On the size of identifying codes in triangle-free graphs.
Florent FoucaudRalf KlasingAdrian KosowskiAndré RaspaudPublished in: Discret. Appl. Math. (2012)
Keyphrases
- graph matching
- maximum clique
- maximal cliques
- graph theoretic
- probabilistic model
- data sets
- error correction
- graph theory
- uniform random
- error correcting codes
- bounded treewidth
- graph representation
- graph mining
- graph structure
- memory requirements
- object recognition
- computational complexity
- case study
- information systems
- learning algorithm
- neural network