Login / Signup
The p-Competition Graphs of Strongly Connected and Hamiltonian Digraphs.
J. Richard Lundgren
Patricia A. McKenna
Larry J. Langley
Sarah K. Merz
Craig W. Rasmussen
Published in:
Ars Comb. (1997)
Keyphrases
</>
strongly connected
directed graph
undirected graph
random walk
optimum path forest
graph structures
graph structure
directed acyclic graph
special case
image segmentation
computational complexity
upper bound
graph matching
minimum cost
graph coloring