|
12
|
I/O-Efficient Algorithms for Shortest Path Related Problems
– Norbert Ralf Zeh
- 2002
|
|
|
A Parallel Algorithm for Approximating the Minimum Cycle Cover
– Philip Klein, Clifford Stein
|
|
3
|
Fully Dynamic Planarity Testing with Applications
– Zvi Galil, et al.
|
|
|
Asymptotic Rate Limits for Randomized Broadcasting with Network Coding
– Di Niu, Baochun Li
|
|
5
|
Error-Resilient Optimal Data Compression
– James A. Storer, John, John H. Reif, Siam J. Comput C
- 1997
|
|
7
|
A fast algorithm for computing steiner edge connectivity
– Ramesh Hariharan
- 2003
|
|
|
Duality, Nowhere-Zero Flows, Colorings and Cycle Covers
– J. Nesetril, A. Raspaud
- 1999
|
|
59
|
Symmetry Breaking In Distributed Networks
– Alon Itai, Michael Rodeh
- 1981
|
|
|
Procurement in Truckload Transportation
– Gultekin Kuyzu
- 2007
|
|
2
|
Shipper collaboration
– Özlem Ergun, Gültekin Kuyzu, Martin Savelsbergh
- 2007
|
|
1
|
Two-connected orientations of Eulerian graphs
– Technical Reports, Tibor Jordán, Alex R. Berg, Alex R. Berg
- 2004
|
|
1
|
A Characterisation of Weakly Four-Connected Graphs
– Tibor Jordán, Technical Reports
- 2003
|
|
10
|
Deterministic O(nm) Time Edge-Splitting in Undirected Graphs
– Hiroshi Nagamochi, Toshihide Ibaraki
- 1997
|
|
12
|
On the Orientation of Graphs and Hypergraphs
– András Frank, Tamás Király, Zoltán Király
- 2001
|
|
|
Parallel Computation: Models and Complexity Issues
– Raymond Greenlaw, H. James Hoover
- 1996
|
|
|
Identifying Strongly Connected Components in Parallel
– William C. McLendon, III, Bruce Hendrickson, Steve Plimpton, Lawrence Rauchwerger
- 2001
|
|
|
Speculative Parallelization of Partially Parallel Loops
– William Mclendon, III, Lawrence Rauchwerger
- 2000
|
|
|
Scalable Multi-Core Model Checking Fairness Enhanced Systems
– Yang Liu, Jun Sun, Jin Song Dong
|
|
3
|
Planar Strong Connectivity Helps in Parallel Depth-First Search
– Ming-yang Kao
- 1992
|
