The Circular Flow Number of a 6-Edge Connected Graph is Less Than Four.

Anna Galluccio Luis A. Goddyn

Published in: Comb. (2002)

Keyphrases

weighted graph
undirected graph
bayesian networks
binary images
memory requirements
graph theory
connected graphs
data structure
connected components
maximum number