On the Minimum Size of an Identifying Code Over All Orientations of a Graph.
Nathann CohenFrédéric HavetPublished in: Electron. J. Comb. (2018)
Keyphrases
- graph representation
- spanning tree
- random walk
- source code
- maximum clique
- graph structure
- edge disjoint
- dominating set
- stable set
- directed graph
- constant factor
- lower bound
- weighted graph
- directed acyclic graph
- connected dominating set
- equivalence classes
- data sets
- undirected graph
- graph matching
- connected components
- operating system
- special case
- computational complexity
- genetic algorithm