Minimum sizes of identifying codes in graphs differing by one vertex.
Irène CharonIiro S. HonkalaOlivier HudryAntoine LobsteinPublished in: Cryptogr. Commun. (2013)
Keyphrases
- undirected graph
- directed graph
- spanning tree
- attributed graphs
- labeled graphs
- graph matching
- average degree
- error correction
- graph theoretic
- minimum length
- maximum cardinality
- graph structure
- connected subgraphs
- hamiltonian cycle
- subgraph isomorphism
- edge weights
- minimum spanning tree
- minimum weight
- neural network
- graph representation
- graph model
- vertex set
- square error
- bipartite graph
- connected dominating set