Mathematical Research Data Initiative
Main page
Recent changes
Random page
SPARQL
MaRDI@GitHub
New item
Special pages
In other projects
MaRDI portal item
Discussion
View source
View history
English
Log in

FIFO preflow algorithm for maximum flow in semi-bipartite networks

From MaRDI portal
Publication:2806717
Jump to:navigation, search

zbMATH Open1349.90159MaRDI QIDQ2806717FDOQ2806717


Authors: Laura Ciupală Edit this on Wikidata


Publication date: 18 May 2016

Published in: Bulletin of the Transilvania University of Brașov. Series III. Mathematics, Informatics, Physics (Search for Journal in Brave)





Recommendations

  • Wave algorithm for maximum flow in semi-bipartite networks
  • Wave algorithm for maximum flow in bipartite networks
  • Improved Algorithms for Bipartite Network Flow
  • Analysis of Preflow Push Algorithms for Maximum Network Flow
  • The maximum flows in bipartite dynamic networks. The static approach


zbMATH Keywords

network flowmaximum flowbipartite networksemi-bipartite network


Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Deterministic network models in operations research (90B10)



Cited In (4)

  • An analysis of the highest-level selection rule in the preflow-push max-flow algorithm
  • Efficient preflow push algorithms
  • Wave algorithm for maximum flow in bipartite networks
  • Wave algorithm for maximum flow in semi-bipartite networks





This page was built for publication: FIFO preflow algorithm for maximum flow in semi-bipartite networks

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

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:2806717&oldid=15714995"
Tools
What links here
Related changes
Printable version
Permanent link
Page information
This page was last edited on 3 February 2024, at 17:43. Warning: Page may not contain recent updates.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki