scientific article; zbMATH DE number 1867228

zbMATH Open1009.05113MaRDI QIDQ4793315

Christian Fremuth-Paeger, Dieter Jungnickel

Publication date: 11 April 2003

Title of this publication is not available (Why is that?)

zbMATH Keywords

matchingnetwork flow

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (2)

Title not available (Why is that?) ⋮ Computer Science Logic

Recommendations

• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Maximum balanced flow in a network 👍 👎
• Balanced network flows. IV: Duality and structure theory. 👍 👎
• Balanced network flows. V: Cycle-canceling algorithms. 👍 👎
• Balanced network flows. VI: Polyhedral descriptions. 👍 👎
• Balanced graphs and network flows 👍 👎
• Distributed Flow Network Balancing With Minimal Effort 👍 👎
• Balancing Applied to Maximum Network Flow Problems 👍 👎

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 Q4793315)