New Bounds for Codes Identifying Vertices in Graphs.
Gérard D. CohenIiro S. HonkalaAntoine LobsteinGilles ZémorPublished in: Electron. J. Comb. (1999)
Keyphrases
- weighted graph
- random graphs
- labeled graphs
- attributed graphs
- undirected graph
- adjacency matrix
- upper bound
- hamiltonian cycle
- planar graphs
- directed graph
- graph theory
- edge weights
- average degree
- maximal cliques
- lower bound
- graph theoretic
- upper and lower bounds
- directed edges
- connected subgraphs
- error bounds
- graph matching
- graph mining
- graph structure
- query graph
- graph clustering
- error correcting
- error correcting codes
- graph databases
- spanning tree
- worst case
- lower and upper bounds
- connected graphs