scientific article; zbMATH DE number 1471729
From MaRDI portal
Publication:4488857
DOI<173::AID-NET1>3.0.CO;2-W 10.1002/(SICI)1097-0037(200005)35:3<173::AID-NET1>3.0.CO;2-WzbMath0966.90077MaRDI QIDQ4488857
Publication date: 20 August 2001
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
minimum-cost flowprimal network simplex algorithmdual network simplex algorithmoptimal pivot selection
Cites Work
- Unnamed Item
- Fast detection of polyhedral intersection
- Making data structures persistent
- Use of dynamic trees in a network simplex algorithm for the maximum flow problem
- A data structure for dynamic trees
- Fully dynamic biconnectivity in graphs
- Data Structures for On-Line Updating of Minimum Spanning Trees, with Applications
- An Optimal Algorithm for Intersecting Three-Dimensional Convex Polyhedra
- Pivot Strategies for Primal-Simplex Network Codes
- Offline Algorithms for Dynamic Minimum Spanning Tree Problems
- Ambivalent Data Structures for Dynamic 2-Edge-Connectivity and k Smallest Spanning Trees
- Sparsification—a technique for speeding up dynamic graph algorithms
This page was built for publication:
