-
F. Dehne,
A. Ferreira,
E. Cáceres,
S. W. Song,
and A. Roncato.
Efficient Parallel Graph Algorithms for Coarse-Grained Multicomputers and BSP.
Algorithmica,
33(2):183-200,
January 2002.
[PDF]
Keyword(s): List ranking,
Euler tour,
Connected components,
Lowest common ancestor,
CGM,
BSP.
@Article{DehneFerreriraCaceresCGM02,
author = {F. Dehne and A. Ferreira and E. C\'aceres and S. W. Song and A. Roncato},
title = {Efficient Parallel Graph Algorithms for Coarse-Grained Multicomputers and {BSP}},
journal = {Algorithmica},
year = 2002,
volume = 33,
number = 2,
pages = {183--200},
month = {January},
pdf = {PAPERS/DehneFerreriraCaceresCGM02.pdf},
keywords = {List ranking, Euler tour, Connected components, Lowest common ancestor, CGM, BSP}
}
-
Mehmet Hakan Karaata.
A stabilizing algorithm for finding biconnected components.
J. Parallel Distrib. Comput.,
62(5):982-999,
2002.
ISSN: 0743-7315.
[PDF]
[doi:http://dx.doi.org/10.1006/jpdc.2001.1833]
Keyword(s): Biconnected components.
@article{KaraataBiconnected02,
author = {Mehmet Hakan Karaata},
title = {A stabilizing algorithm for finding biconnected components},
journal = {J. Parallel Distrib. Comput.},
volume = {62},
number = {5},
year = {2002},
issn = {0743-7315},
pages = {982--999},
doi = {http://dx.doi.org/10.1006/jpdc.2001.1833},
publisher = {Academic Press, Inc.},
address = {Orlando, FL, USA},
keywords = {Biconnected components},
pdf = {../papers/KaraataBiconnected02.pdf}
}
-
Thomas Nitsche.
Lifting Sequential Functions to Parallel Skeletons.
Parallel Processing Letters,
12(2):267-284,
June 2002.
@Article{Nitsche02:Lifting,
author = {Thomas Nitsche},
title = {Lifting Sequential Functions to Parallel Skeletons},
journal = {Parallel Processing Letters},
year = 2002,
volume = 12,
number = 2,
pages = {267--284},
month = {June}
}
-
Y. H. Tsin.
Some remarks on distributed depth-first search.
Information Processing Letters,
82(4):173-178,
2002.
ISSN: 0020-0190.
[PDF]
Keyword(s): Analysis of algorithms,
Depth-first search,
Distributed algorithm,
Communication network.
Comments: |
Overview of many distributed and parallel depth-first search algorithms |
@Article{TsinDFS02,
author = {Y. H. Tsin},
title = {Some remarks on distributed depth-first search},
journal = {Information Processing Letters},
volume = {82},
number = {4},
year = {2002},
issn = {0020-0190},
pages = {173--178},
publisher = {Elsevier North-Holland, Inc.},
keywords = {Analysis of algorithms; Depth-first search; Distributed algorithm; Communication network},
pdf = {PAPERS/TsinDFS02.pdf},
comments = {Overview of many distributed and parallel depth-first search algorithms}
}
-
Bin Luo,
Richard C. Wilson,
and Edwin R. Hancock.
Spectral Feature Vectors for Graph Clustering.
In Proceedings of the Joint IAPR International Workshop on Structural, Syntactic, and Statistical Pattern Recognition,
London, UK,
pages 83-93,
2002.
Springer-Verlag.
ISBN: 3-540-44011-9.
@inproceedings{LWH_SpectralClustering2002,
author = {Bin Luo and Richard C. Wilson and Edwin R. Hancock},
title = {Spectral Feature Vectors for Graph Clustering},
booktitle = {Proceedings of the Joint IAPR International Workshop on Structural, Syntactic, and Statistical Pattern Recognition},
year = {2002},
isbn = {3-540-44011-9},
pages = {83--93},
publisher = {Springer-Verlag},
address = {London, UK},
}
-
Saeko Nomura,
Satoshi Oyama,
Tetsuo Hayamizu,
and Toru Ishida.
Analysis and Improvement of HITS Algorithm for Detecting Web Communities.
In SAINT '02: Proceedings of the 2002 Symposium on Applications and the Internet,
Washington, DC, USA,
pages 132-140,
2002.
IEEE Computer Society.
ISBN: 0-7695-1447-2.
@inproceedings{691405,
author = {Saeko Nomura and Satoshi Oyama and Tetsuo Hayamizu and Toru Ishida},
title = {Analysis and Improvement of HITS Algorithm for Detecting Web Communities},
booktitle = {SAINT '02: Proceedings of the 2002 Symposium on Applications and the Internet},
year = {2002},
isbn = {0-7695-1447-2},
pages = {132--140},
publisher = {IEEE Computer Society},
address = {Washington, DC, USA},
}