Computing the binding number of a graph

Authors:
W. H. Cunningham
Affiliations:
-
Venue:
Discrete Applied Mathematics
Year:
1990

Citing 0
Cited 2

Perfect arborescence packing in preflow mincut graphs

Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
Toughness and binding number

Discrete Applied Mathematics

Quantified Score

Hi-index	0.04

Visualization

Abstract