|
Journals in DBLP
Algorithmica 1997, volume: 19, number: 4
- Gary L. Miller, Shang-Hua Teng
Tree-Based Parallel Algorithm Design. [Citation Graph (0, 0)][DBLP] Algorithmica, 1997, v:19, n:4, pp:369-389 [Journal]
- Boris V. Cherkassky, Andrew V. Goldberg
On Implementing the Push-Relabel Method for the Maximum Flow Problem. [Citation Graph (0, 0)][DBLP] Algorithmica, 1997, v:19, n:4, pp:390-410 [Journal]
- Shun-Shii Lin, Kwei-Jay Lin
A Pinwheel Scheduler for Three Distinct Numbers with a Tight Schedulability Bound. [Citation Graph (0, 0)][DBLP] Algorithmica, 1997, v:19, n:4, pp:411-426 [Journal]
- Therese C. Biedl, Goos Kant, Michael Kaufmann
On Triangulating Planar Graphs Under the Four-Connectivity Constraint. [Citation Graph (0, 0)][DBLP] Algorithmica, 1997, v:19, n:4, pp:427-446 [Journal]
- Gautam Das, Sanjiv Kapoor, Michiel H. M. Smid
On the Complexity of Approximating Euclidean Traveling Salesman Tours and Minimum Spanning Trees. [Citation Graph (0, 0)][DBLP] Algorithmica, 1997, v:19, n:4, pp:447-460 [Journal]
|