A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Filters
Parallel ear decomposition search (EDS) and st-numbering in graphs
[chapter]
1986
Lecture Notes in Computer Science
Preserved Fulltext
The first contribution of this paper is a general method for searching efficiently in parallel undirected graphs, called ear decomposition search (EDS). ...
The second contribution demonstrates the applicability of this search method. We present an efficient parallel algorithm for st-numbering in a biconnected graph. ...
This enables exploration of the graph in an 'orderly' manner. We call this search technique ear decomposition search (EDS). ...
doi:10.1007/3-540-16766-8_4
fatcat:2ggarmig6jdj3mkz2zbz2epqp4
Parallel ear decomposition search (EDS) and st-numbering in graphs
1986
Theoretical Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
The first contribution of this paper is a general method for searching efficiently in parallel undirected graphs, called ear decomposition search (EDS). ...
The second contribution demonstrates the applicability of this search method. We present an efficient parallel algorithm for st-numbering in a biconnected graph. ...
This enables exploration of the graph in an 'orderly' manner. We call this search technique ear decomposition search (EDS). ...
doi:10.1016/0304-3975(86)90153-2
fatcat:y65vame6gbdebj2qkqvh6dkbsi
Page 3782 of Mathematical Reviews Vol. , Issue 88g
[page]
1988
Mathematical Reviews
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
size of the items asymptotically approaches 1.”
88g:68046 68Q20 05C99 68R10
Maon, Yael (IL-TLAV-C); Schieber, Baruch (IL-TLAV-C);
Vishkin, Uzi (IL-TLAV-C)
Parallel ear decomposition search (EDS) and st-numbering ...
This search technique is then used to de- velop a fast and efficient parallel algorithm for st-numbering in a biconnected graph. ...
Dynamic data structures for series parallel digraphs
[chapter]
1989
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
We consider the problem of dynamically maintaining general series parallel directed acyclic graphs (GSP dags). two-terminal series parallel directed acyclic graphs (TTSP dags) and looped series parallel ...
TTSP clags and looped SP digraphs of m edges and n vertices in O( log n) worst-case time. ...
Acknowledgements \Ve would like to thank David Eppstein for many useful suggestions and discussions. We are also indebted to Giorgio Ausiello for his can tinuous support and encouragement. ...
doi:10.1007/3-540-51542-9_30
fatcat:wyczt4ql75cptoziudqo5rssli
Finding Triconnected Components by Local Replacement
1993
SIAM journal on computing (Print)
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2005; you can also visit the original URL.
The file type is application/pdf.
The time complexity of our algorithm is Olog n and the processor-time product is Om + n log log n where n is the numberofvertices, and m is the number of edges of the input graph. ...
Our algorithm, like other parallel algorithms for this problem, is based on open ear decomposition but it employs a new technique, local replacement, to improve the complexity. ...
the algorithm of 25 , and for nding an st-numbering in a biconnected graph from the algorithm of 19 . ...
doi:10.1137/0222040
fatcat:rsxiqsveurcadhe73k7w6pusza
Planarity testing in parallel
1994
Journal of computer and system sciences (Print)
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
We present a parallel algorithm based on open ear decomposition to construct an embedding of a graph onto the plane or report that the graph is nonplanar. ...
Our parallel algorithm runs on a CRCW PRAM in logarithmic time with a number of processors bounded by that needed for finding connected components in a graph and for performing bucket sort. ...
We search the graph using a parallel algorithm for open ear decomposition [MR86, MSV86, Ra93l. ...
doi:10.1016/s0022-0000(05)80070-4
fatcat:ryh3jna43zgtvnplomjl3cx6fu
Structural parallel algorithmics
[chapter]
1991
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2015; you can also visit the original URL.
The file type is application/pdf.
A technique called ear decomposition search (EDS) was suggested as a replacement for DFS in the context of efficient and fast parallel algorithms [MSV86J and [MR86] , after an earlier suggestion in [Lov85 ...
An st-i
he
or
1st
in
d)
)le
ti
rid
hs
ur
he
Tie
on
si
ng
is
'or
rig
as
ed
es
ss
Depth first search (
Ram90J and [RamOl]. ...
doi:10.1007/3-540-54233-7_148
fatcat:7itpvjsg7ngmbdh4aj6xpxe2he
7th North Armerican Caribou Conference, 19-21 August 1996, Thunder Bay, Ontario, Canada
1998
Rangifer
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
The 7th North American Caribou Conference was held August 19-21 1996, in Thunder Bay, Ontario, Canada where 136 registrants participated in 3 days of sessions and subsequent field tours. ...
Acknowledgements Reviews by Lee Eberhardt, Sam Barry, Frank Miller, Anne Gunn, Harry Armbruster, and two others were most helpful. ...
As well Jim Baker, David Hogg, Ted Armstrong, Gerry Racey, Rob Rempel, Perer Duinker and Gail Giuliani have made many helpful suggestions. ...
doi:10.7557/2.18.5.1393
fatcat:wfhq5xtrings5gpcmayzxwolj4
Satisfying Privacy Requirements: One Step before Anonymization
[chapter]
2010
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
ersees
uting,
ed as
eval
ine
the
re he
. ...
,
nnovative an
Biography
g Director at
Search and
an Computer
Wei-Ying's tea
rch, data min
ed key techno
ublished exte
WW, and ACM
Ying was with
ation and dis
the Alexandr
Dr ...
Prices and other details are subject to change without notice. All errors and omissions excepted. *** Regional restrictions apply. ...
doi:10.1007/978-3-642-13657-3_21
fatcat:qbg6buz6nrbexnb7xz7sdjgfo4
14th International Symposium on Mathematical Programming
1990
Mathematical programming
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2003; you can also visit the original URL.
The file type is application/pdf.
If we use a decomposition approach in order to solve a minimization problem we often get an objective function in such a w a y that its domain dom 6 = n is not given explicitely to us. ...
Finally I report numerical results of a comparison between the variant and a minimization approach using penalty functions. ...
as the maximum weight matching with degree constraints in a general graph, and the sequencing problem which is a shortest path problem to visit speci ed number of nodes in a weighted graph. ...
doi:10.1007/bf01580875
fatcat:3jtclwmntzgjxkqs5uecombdaa
A Study on the Locality Behavior of Minimum Spanning Tree Algorithms
[chapter]
2006
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Parallel ear decomposition search (EDS) and st-
numbering in graphs. Theoretical Computer Science, 47(3):277–296, 1986.
18. B.M.E. Moret and H.D. Shapiro. ...
Efficient parallel ear decomposition with applications.
Manuscript, UC Berkeley, MSRI, January 1986.
17. Y. Moan, B. Schieber, and U. Vishkin. ...
doi:10.1007/11945918_55
fatcat:3h6armdmvzcw7bxqmh74nyetgq
Distributed data structures in Linda
1986
Proceedings of the 13th ACM SIGACT-SIGPLAN symposium on Principles of programming languages - POPL '86
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Distributed data structures are impossible in most parallel programming languages, but they are supported in the parallel language Ltnda and they are central to Linda programming style. ...
Distributed data structures are the natural complement to parallel program structures~ where a parallel program (for our purposes) is one that is made up of many simultaneously active, communicating processes ...
Our 1A 128-~ede i~td iPSC and ~ 84~aode cube designed and built by Erie DeBesedi¢~,i~ af AT&T Bell L~, the matched tuple itself remaining in TS in either case. eval (t) is tile sarse as out(t), except ...
doi:10.1145/512644.512666
dblp:conf/popl/CarrieroGL86
fatcat:55xufg73hfca3k7fye6yknkr7q
Cascading divide-and-conquer: A technique for designing parallel algorithms
1987
28th Annual Symposium on Foundations of Computer Science (sfcs 1987)
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
T<:chniqucs for parallt:l divide-and-conquer are presenled. rcsulting in improved parallel :lIgo r jthms for a number of probl<:ms. ...
This paper presents a number of genel'al techniques for parallel divide-and-conquer. ...
~pond 10 rile l'isfble reKiOlI for XI II) and fhe solid segments correspond to fhe visible regl-onfor X( wi. ...
doi:10.1109/sfcs.1987.12
dblp:conf/focs/AtallahCG87
fatcat:twgvhn5yizekbprpe63fntcns4
Compiler transformations for high-performance computing
1994
ACM Computing Surveys
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
to
declare data decomposition
strategies
and
to expose parallelism. ...
The alignment-distribution
graph.
In
Proceedings
of the 6th International
Workshop
on Languages
and Compilers
for Parallel
Com-
puting. ...
., AND FERRANTE, J. 1988a ...
doi:10.1145/197405.197406
fatcat:25a5pcdu3nhwfazwnhdts5qyzy
4th International Reindeer/Caribou Symposium, 22-25 August 1985, Whitehorse, Canada
1986
Rangifer
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
Abstract: We describe and give frequencies of occurrence of a rarely-mentioned pattern of spots in Rangifer pelage. ...
Thomas
Acknowledgements This study was supported in part by the Norwegian Reindeer Administration and the Norwegian Research Council for Science and Humanities. ...
Up to 1965 harvest statistics included number of licences issued and total number of 14-y ear males and females killed. ...
doi:10.7557/2.6.2.555
fatcat:c7pi7lg7drhkvlywnojuzi345m
« Previous
Showing results 1 — 15 out of 718 results