-
George Karypis and Vipin Kumar.
Multilevel k-way Partitioning Scheme for Irregular Graphs.
Journal of Parallel and Distributed Computing,
48(1):96-129,
1998.
[WWW]
@article{ karypis98multilevel,
author = "George Karypis and Vipin Kumar",
title = "Multilevel k-way Partitioning Scheme for Irregular Graphs",
journal = "Journal of Parallel and Distributed Computing",
volume = "48",
number = "1",
pages = "96-129",
year = "1998",
url = "citeseer.ist.psu.edu/article/karypis98multilevel.html"
}
-
Bala Swaminathan and Kenneth J. Goldman.
An Incremental Distributed Algorithm for Computing Biconnected Components in Dynamic Graphs.
Algorithmica,
22(3):305-329,
November 1998.
[PDF]
Keyword(s): Biconnected components.
@Article{SwaminathanBiconnected98,
author = {Bala Swaminathan and Kenneth J. Goldman},
title = {An Incremental Distributed Algorithm for Computing Biconnected Components in Dynamic Graphs},
journal = {Algorithmica},
year = 1998,
volume = 22,
number = 3,
pages = {305--329},
month = {November},
keywords = {Biconnected components},
pdf = {../papers/SwaminathanBiconnected98.pdf}
}
-
Duncan Watts and Steven Strogatz.
Collective dynamics of 'small-world' networks.
Nature,
393:440-442,
1998.
[PDF]
@Article{WattsStrogatzSmallWorld98,
author = {Duncan Watts and Steven Strogatz},
title = {Collective dynamics of 'small-world' networks},
journal = {Nature},
year = 1998,
volume = 393,
pages = {440--442},
pdf = {PAPERS/WattsStrogatzSmallWorld98.pdf}
}
-
Micah Adler,
Wolfgang Dittrich,
Ben Juurlink,
Mirosław Kutyłowski,
and Ingo Rieping.
Communication-optimal parallel minimum spanning tree algorithms.
In Proceedings of the tenth annual ACM symposium on Parallel algorithms and architectures,
pages 27-36,
1998.
ACM Press.
ISBN: 0-89791-989-0.
[PDF]
Keyword(s): Minimum spanning tree.
@InProceedings{AdlerDittrichJuurlinkMST98,
author = {Micah Adler and Wolfgang Dittrich and Ben Juurlink and Miros\&\#322;aw Kuty\&\#322;owski and Ingo Rieping},
title = {Communication-optimal parallel minimum spanning tree algorithms},
booktitle = {Proceedings of the tenth annual {ACM} symposium on Parallel algorithms and architectures},
year = {1998},
isbn = {0-89791-989-0},
pages = {27--36},
location = {Puerto Vallarta, Mexico},
publisher = {ACM Press},
keywords = {Minimum spanning tree},
pdf = {PAPERS/AdlerDittrichJuurlinkMST98.pdf}
}
-
Noga Alon,
Michael Krivelevich,
and Benny Sudakov.
Finding a large hidden clique in a random graph.
In SODA '98: Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms,
Philadelphia, PA, USA,
pages 594-598,
1998.
Society for Industrial and Applied Mathematics.
ISBN: 0-89871-410-9.
@inproceedings{315014,
author = {Noga Alon and Michael Krivelevich and Benny Sudakov},
title = {Finding a large hidden clique in a random graph},
booktitle = {SODA '98: Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms},
year = {1998},
isbn = {0-89871-410-9},
pages = {594--598},
location = {San Francisco, California, United States},
publisher = {Society for Industrial and Applied Mathematics},
address = {Philadelphia, PA, USA},
}
-
Andreas Crauser,
Kurt Mehlhorn,
Ulrich Meyer,
and Peter Sanders.
A Parallelization of Dijkstra's Shortest Path Algorithm.
In Lubos Brim,
Jozef Gruska,
and Jirì Zlatuska, editors,
Mathematical Foundations of Computer Science,
volume 1450 of Lecture Notes in Computer Science,
pages 722-731,
1998.
Springer.
[PDF]
Keyword(s): Single-source shortest paths,
CRCW,
PRAM.
@InProceedings{CrauserMehlhornMeyerSSSP98,
author = {Andreas Crauser and Kurt Mehlhorn and Ulrich Meyer and Peter Sanders},
title = {A Parallelization of {D}ijkstra's Shortest Path Algorithm},
booktitle = {Mathematical Foundations of Computer Science},
pages = {722--731},
year = 1998,
editor = {Lubos Brim and Jozef Gruska and Jir\'{\i} Zlatuska},
volume = 1450,
series = {Lecture Notes in Computer Science},
publisher = {Springer},
keywords = {Single-source shortest paths, CRCW, PRAM},
pdf = {PAPERS/CrauserMehlhornMeyerSSSP98.pdf}
}
-
Frank Dehne and Silvia Götz.
Practical Parallel Algorithms for Minimum Spanning Trees.
In Symposium on Reliable Distributed Systems,
pages 366-371,
1998.
[PDF]
Keyword(s): Minimum spanning tree.
@InProceedings{DehneGotzMST98,
author = {Frank Dehne and Silvia G\"{o}tz},
title = "Practical Parallel Algorithms for Minimum Spanning Trees",
booktitle = "Symposium on Reliable Distributed Systems",
pages = "366--371",
year = "1998",
keywords = {Minimum spanning tree},
pdf = {PAPERS/DehneGotzMST98.pdf}
}
-
Afonso Ferreira,
Isabelle Guerin Lassous,
K. Marcus,
and Andrew Rau-Chaplin.
Parallel Computation on Interval Graphs Using PC Clusters: Algorithms and Experiments.
In European Conference on Parallel Processing,
pages 875-886,
1998.
[POSTSCRIPT]
Keyword(s): Interval graph,
Connected components,
Maximum Weighted Clique,
Breadth-first Search,
Depth-first Search,
CGM.
@InProceedings{FerreiraLassousMarcusInterval98,
author = {Afonso Ferreira and Isabelle Guerin Lassous and K. Marcus and Andrew Rau-Chaplin},
title = {Parallel Computation on Interval Graphs Using {PC} {Clusters}: Algorithms and Experiments},
booktitle = {European Conference on Parallel Processing},
pages = {875--886},
year = {1998},
ps = {PAPERS/FerreiraLassousMarcusInterval98.ps},
keywords = {Interval graph, Connected components, Maximum Weighted Clique, Breadth-first Search, Depth-first Search, CGM}
}
-
Ulrich Meyer and Peter Sanders.
Delta-Stepping: A Parallel Single Source Shortest Path Algorithm.
In Proceedings of the 6th Annual European Symposium on Algorithms,
pages 393-404,
1998.
Springer-Verlag.
ISBN: 3-540-64848-8.
@InProceedings{Meyer98:Delta,
author = {Ulrich Meyer and Peter Sanders},
title = {Delta-Stepping: A Parallel Single Source Shortest Path Algorithm},
booktitle = {Proceedings of the 6th Annual European Symposium on Algorithms},
year = {1998},
isbn = {3-540-64848-8},
pages = {393--404},
publisher = {Springer-Verlag},
}
-
L. Rauchwerger,
F. Arzu,
and K. Ouchi.
Standard Templates Adaptive Parallel Library.
In Wkshp. on Lang. Comp. and Run-time Sys. for Scal. Comp. (LCR),
volume 1511 of LNCS,
pages 402-410,
May 1998.
[PDF]
Keyword(s): STAPL.
@InProceedings{RauchwergerSTAPL98,
author = {L. Rauchwerger and F. Arzu and K. Ouchi},
title = {{S}tandard {T}emplates {A}daptive {P}arallel {L}ibrary},
booktitle = {Wkshp. on Lang. Comp. and Run-time Sys. for Scal. Comp. (LCR)},
pages = {402--410},
year = 1998,
volume = 1511,
series = {LNCS},
month = {May},
keywords = {STAPL},
pdf = {PAPERS/RauchwergerSTAPL98.pdf}
}
-
Todd L. Veldhuizen and Dennis Gannon.
Active Libraries: Rethinking the roles of compilers and libraries.
In Proceedings of the SIAM Workshop on Object Oriented Methods for Inter-operable Scientific and Engineering Computing,
1998.
SIAM Press.
@inproceedings{Veldhuizen98:active_libraries,
author = "Todd L. Veldhuizen and Dennis Gannon",
title = "Active Libraries: Rethinking the roles of compilers and libraries",
booktitle = "Proceedings of the SIAM Workshop on Object Oriented Methods for Inter-operable Scientific and Engineering Computing",
publisher = "SIAM Press",
year = "1998",
conflocation = "Yorktown Heights, New York",
conftitle = "SIAM Workshop on Object Oriented Methods for Inter-operable Scientific and Engineering Computing"
}