Panagiota Fatourou, Paul Spirakis, Panagiotis Zarafidis, Anna Zoura  Home/Search
Context Related
| ag2.mpisb.mpg.de/...connectivity.ps.gz helios.cti.gr/alco...connectivity.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: ag2.mpisb.mpg.de/~fatur...public (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: In this paper we describe robust and efficient implementations of two graph connectivity algorithms. The implementations are based on the LEDA library of efficient data types and algorithms [18]. Moreover, we provide experimental evaluations of the implemented algorithms and we compare their performance to other graph connectivity algorithms currently implemented in LEDA. The first algorithm is the Karp and Tarjan algorithm [16] for finding the connected components of an undirected graph. ... (Update)
Cited by: More
Implementation and Experimental Evaluation of.. - Fatourou.. (Correct)
Active bibliography (related documents): More All
0.7: Stochastic Graphs Have Short Memory: Fully Dynamic.. - Nikoletseas, Reif.. (1995) (Correct)
0.5: Implementation of a Linear Expected-Time Algorithm .. - Fatourou.. (1997) (Correct)
0.2: An Experimental Study of Dynamic Algorithms for.. - Frigioni, Miller.. (2000) (Correct)
Similar documents based on text: More All
1.1: Desktop Synchronous Distance Learning Application Enhanced.. - Bouras, Gkamas, al. (Correct)
0.7: Policies For Content Filtering In Educational Networks: The.. - Avgoulea, Bouras (Correct)
0.5: A Web-Based ITS Controlled by an Expert System - Prentzas, Hatzilygeroudis.. (2001) (Correct)
Related documents from co-citation: More All
2: LEDA: A platform for combinatorial and geometric computing - Mehlhorn, Naher - 1995
BibTeX entry: (Update)
P. Fatourou, P. Spirakis, P. Zarafidis and A. Zoura, "Implementation and Experimental Evaluation of Graph Connectivity Algorithms using LEDA," http://students.ceid.upatras.gr/~faturu/projects.htm http://citeseer.ist.psu.edu/276741.html More
@article{ fatourou99implementation,
author = "Panagiota Fatourou and Paul Spirakis and Panagiotis Zarafidis and Anna Zoura",
title = "Implementation and Experimental Evaluation of Graph Connectivity Algorithms Using {LEDA}",
journal = "Lecture Notes in Computer Science",
volume = "1668",
pages = "124--??",
year = "1999",
url = "citeseer.ist.psu.edu/276741.html" }
Citations (may not include all citations):3972 Introduction to Algorithms (context) - Cormen, Leiserson et al. - 1990
375 LEDA, A platform for combinatorial and geometric computing - Mehlhorn, Naher - 1995
375 The LEDA Platform of Combinatorial and Geometric Computing - Mehlhorn, Naher - 1999
283 Random Graphs (context) - Bollobas - 1985
132 the evolution of random graphs (context) - Erdos, Renyi - 1960
118 Data Structures for On-Line Updating of Minimum Spanning Tre.. (context) - Frederickson - 1985
101 Sparsification - A Technique for Speeding Up Dynamic Graph A.. (context) - Epstein, Galil et al. - 1997
25 Separator Based Sparsification for Dynamic Planar Graph Algo.. (context) - Eppstein, Galil et al. - 1996
23 Ambivalent data structures for dynamic 2-edge connectivity a.. (context) - Frederickson - 1991
16 Fully dynamic algorithms for edge-connectivity problems - Galil, Italiano - 1991
13 Experimental Analysis of Dynamic Minimum Spanning Tree Algor.. - Amato, Cattaneo et al. - 1997
12 Average Case Analysis of Dynamic Graph Algorithms - Alberts, Henzinger - 1995
5 An Experimental Study of Dynamic Algorithms for Directed Gra.. (context) - Frigioni, Miller et al. - 1998
4 Linear Expected Time for Connectivity Problems (context) - Karp, Tarjan - 1980
3 Stochastic Graphs Have Short Memory: Fully Dynamic Connectiv.. - Nikoletseas, Reif et al. - 1995
1 An Empirical Study of Dynamic Algorithms (context) - Alberts, Cattaneo et al. - 1997
1 User Manual (context) - Package, Algorithms - 1998
1 Randomized Graph Algorithms with Polylogarithmic Time per Op.. (context) - Henzinger, King - 1995
1 A Software Library of Dynamic Graph Algorithms (context) - Amato, Cattaneo et al. - 1998
1 Implementation and Experimental Evaluation of Graph Connecti.. - Fatourou, Spirakis et al.
Documents on the same site (http://www.ag2.mpi-sb.mpg.de/~faturu/public.htm):
Max-Min Fair Flow Control Sensitive to Priorities - Fatourou, Mavronicolas.. (1999) (Correct)
Efficient Scheduling of Strict Multithreaded Computations - Fatourou, Spirakis (1999) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC