On integer balancing of directed graphs
From MaRDI portal
Publication:2242913
Recommendations
Cites work
- Coordination of groups of mobile autonomous agents using nearest neighbor rules
- Distributed Integer Weight Balancing in the Presence of Time Delays in Directed Graphs
- Fast Approximation Algorithms for Fractional Packing and Covering Problems
- Faster and Simpler Algorithms for Multicommodity Flow and Other Fractional Packing Problems
- scientific article; zbMATH DE number 1239298 (Why is no real title available?)
- On a Class of Directed Graphs—With an Application to Traffic-Flow Problems
Cited in
(5)- scientific article; zbMATH DE number 3841916 (Why is no real title available?)
- Node-balancing by edge-increments
- scientific article; zbMATH DE number 1472197 (Why is no real title available?)
- Realizing degree imbalances in directed graphs
- On the existence of an integral potential in a weighted bidirected graph
This page was built for publication: On integer balancing of directed graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2242913)