Efficient algorithms for generalized cut‐trees

DOI10.1002/net.3230210503zbMath0737.90070OpenAlexW1975020368MaRDI QIDQ3978604

Dalit Naor, Dan Gusfield

Publication date: 25 June 1992

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.3230210503

zbMATH Keywords

minimum edge cutsweighted undirected graphGomory-Hu cut tree

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items (2)

Flow trees for vertex-capacitated networks ⋮ Extracting maximal information about sets of minimum cuts

Cites Work

• On the structure of all minimum cuts in a network and applications
• Unnamed Item
• Unnamed Item

This page was built for publication: Efficient algorithms for generalized cut‐trees