scientific article; zbMATH DE number 3900543

MaRDI QIDQ3678992zbMATH OpenFDO

Authors Robert E. Tarjan

Publication date 1984

zbMATH Keywords

maximum matchingsmaximum network flowsminimum spanning treesnetwork optimizationshortest pathssurvey

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Numerical mathematical programming methods (65K05) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02) Deterministic network models in operations research (90B10) Programming involving graphs or networks (90C35)

Recommendations

• Algorithms for maximum network flow
• scientific article; zbMATH DE number 1953188
• scientific article; zbMATH DE number 65738
• Efficient algorithms for finding maximum matching in graphs
• scientific article; zbMATH DE number 4204092

Cited in

(4)

• Network optimization: algorithms and applications
• Algorithms for maximum network flow
• scientific article; zbMATH DE number 65738 (Why is no real title available?)
• scientific article; zbMATH DE number 1953188 (Why is no real title available?)

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3678992)