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

scientific article; zbMATH DE number 1138299

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

zbMATH Open0890.05068MaRDI QIDQ4383576FDOQ4383576


Authors: N. V. Prodan Edit this on Wikidata


Publication date: 7 April 1998



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




zbMATH Keywords

algorithmdynamical programmingtree of minimax paths


Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Games involving graphs (91A43)



Cited In (7)

  • Global optimization: On pathlengths in min-max graphs
  • Recognizing max-flow min-cut path matrices
  • An \(O(mn)\) algorithm for the 1-maximin problem on a network
  • An algorithm to determine a path with minimal cost/capacity ratio
  • Title not available (Why is that?)
  • Algorithms and Computation
  • An algorithm for the minimum variance point of a network





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

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