Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

scientific article; zbMATH DE number 910923

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

zbMath0849.90057MaRDI QIDQ4886100

Jyrki Katajainen, Naomi Nishimura, Torben Hagerup, Prabhakar Ragde

Publication date: 22 August 1996


Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

parallel algorithmflow network


Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Analysis of algorithms and problem complexity (68Q25) Deterministic network models in operations research (90B10) Parallel numerical computation (65Y05)


Related Items (4)

On mimicking networks representing minimum terminal cuts ⋮ Maximum \(k\)-splittable \(s, t\)-flows ⋮ Parallel algorithms with optimal speedup for bounded treewidth ⋮ Faster algorithms for shortest path and network flow based on graph decomposition




This page was built for publication:

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:4886100&oldid=19258998"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 8 February 2024, at 05:13.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki