Decomposition of the complete directed graph into k-circuits.

Jean-Claude Bermond Vance Faber

Published in: J. Comb. Theory, Ser. B (1976)

Keyphrases

directed graph
random walk
strongly connected
high speed
logic synthesis
maximum flow
directed edges
undirected graph
decomposition method
circuit design
graph structures
digital circuits
shortest path problem
web graph
graph properties
disjoint paths
directed acyclic graph