Earliest arrival flows on series-parallel graphs (Q3082606): Difference between revisions
From MaRDI portal
Created a new Item |
Normalize DOI. |
||
(6 intermediate revisions by 5 users not shown) | |||
Property / DOI | |||
Property / DOI: 10.1002/net.20398 / rank | |||
Property / author | |||
Property / author: Heike Sperber / rank | |||
Property / author | |||
Property / author: Heike Sperber / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W1907168435 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3056948 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Minimum cost flow algorithms for series-parallel networks / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Quickest Flows Over Time / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Transient flows in networks / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Multicommodity flows over time: Efficient algorithms and complexity / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Minimum-cost dynamic flows: The series-parallel case / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Maximal, Lexicographic, and Dynamic Network Flows / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The Recognition of Series Parallel Digraphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: An Algorithm for Universal Maximal Dynamic Flows in a Network / rank | |||
Normal rank | |||
Property / DOI | |||
Property / DOI: 10.1002/NET.20398 / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 15:30, 20 December 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Earliest arrival flows on series-parallel graphs |
scientific article |
Statements
Earliest arrival flows on series-parallel graphs (English)
0 references
16 March 2011
0 references
dynamic network flows
0 references
earliest arrival flows
0 references
universally maximal dynamic flows
0 references
discrete time setting
0 references
series-parallel graphs
0 references
polynomial algorithms
0 references