Login / Signup

Identifying and locating-dominating codes: NP-Completeness results for directed graphs.

Irène CharonOlivier HudryAntoine Lobstein
Published in: IEEE Trans. Inf. Theory (2002)
Keyphrases
  • directed graph
  • random walk
  • error correction
  • undirected graph
  • maximum flow
  • graph structure
  • directed acyclic graph
  • graph structures
  • strongly connected
  • image sequences
  • web graph