Showing 81 - 58 of 58

81

Optimal Parallel Algorithms for Rectilinear Link Distance Problems
Andrzej Lingas ; Anil Maheshwari ; Jörg-Rüdiger Sack ; et al.
http://www.dna.lth.se/Research/Algorithms/Papers/andrzej6.ps.

Computational geometry Algorithms and data stru... Parallel computation Link distance Rectilinear polygons
Academic journal
Save to List
82

A linear time algorithm for triconnectivity augmentation
Tsan-sheng Hsu ; Vijaya Ramachandran ; The Pennsylvania State University CiteSeerX Archives
http://www.cs.utexas.edu/~vlr/papers/focs91.pdf.

Academic journal
Save to List
83

Δ-Stepping : A Parallel Single Source Shortest Path Algorithm
Ulrich Meyer ; Peter Sanders
Lecture Notes in Computer Science ISBN: 9783540648482

Book
Save to List
84

Algorithms for finding f-colorings of partial k-trees: An extended abstract
Takao Nishizeki ; Xiao Zhou
Lecture Notes in Computer Science ISBN: 9783540605737

4. Education
Book
Save to List
85

On finding a smallest augmentation to biconnect a graph (Extended abstract)
Tsan-sheng Hsu ; Vijaya Ramachandran
Lecture Notes in Computer Science ISBN: 9783540549451

Book
Save to List
86

SCCMulti: an improved parallel strongly connected components algorithm
Nancy M. Amato ; Daniel Tomkins ; Lawrence Rauchwerger ; et al.
ACM SIGPLAN Notices. 49:393-394

0102 computer and inform... 01 natural sciences
Academic journal
Save to List
87

Processor Efficient Parallel Algorithms for the Two Disjoint Paths Problem and for Finding a Kuratowski Homeomorph: Processor efficient parallel algorithms for the two disjoint paths problem and for finding a Kuratowski homeomorph
Stephen G. Mitchell ; Samir Khuller ; Vijay V. Vazirani
SIAM Journal on Computing. 21:486-506

Connectivity disjoint paths parallel algorithm Graph theory (including... Analysis of algorithms a... Kuratowski homeomorph
Academic journal
Save to List
88

$\Delta$-Stepping: A Parallel Single Source Shortest Path Algorithm
Meyer, U. ; Sanders, P.
Proceedings of the 6th Annual European Symposium on Algorithms (ESA-98) ; Lecture Notes in Computer Science

Conference
Save to List
89

Some Optimal Parallel Algorithms on Interval and Circular-Arc Graphs
許芳榮 ; 沈錳坤 ; 趙考蜀 ; et al.

parallel algorithms,EREW...
Academic journal
Save to List
90

Some optimal parallel algorithms on interval and circular-arc graphs
李家同 ; Lee, RCT ; 管理學院:資訊管理學系 ; et al.

parallel algorithms EREW PRAM all-pair shortest path hinge vertex interval graph
Academic journal
Save to List
92

Some Optimal Parallel Algorithms on Interval and Circular-arc Graphs *
F. R. Hsu ; M. K. Shan ; H. S. Chao ; et al.
http://www.iis.sinica.edu.tw/page/jise/2005/200505_08.pdf.

parallel algorithms EREW PRAM all-pair shortest path hinge vertex interval
Academic journal
Save to List
94

This result is not available to guest users.

95

This result is not available to guest users.

96

Processor Efficient Parallel Algorithms for the Two Disjoint Paths Problem, and for Finding a Kuratowski Homeomorph
Khuller, Samir ; Mitchell, Stephen G. ; Vazirani, Vijay V.

computer science technical report
Report
Save to List
97

This result is not available to guest users.

98

This result is not available to guest users.


Filter