Strongly connected components

Strongly connected components

Post by Ole Ildsgaard Hougaa » Wed, 31 Dec 1997 04:00:00



I am looking for an algorithm for maintaining strongly connected
components under edge and node insertions. Any pointers?

- Ole

--
* Ole I. Hougaard                            *                            *
* BRICS, Comp. Sci. Dep. Aarhus University   *  Telephone   +45 8642 3188 *
* Ny Munkegade 116, Building 540             *  Direct call +45 8942 3288 *
* DK-8000 Aarhus C, Denmark                  *  Fax         +45 8942 3255 *

 
 
 

1. Algorithms for Incremental Strongly Connected Components ?

Hello again,

I'm also trying to find algorithms which maintain the strongly
connected components of a directed graph in the presence of edge
insertions/deletions. I have so far found nothing on this topic. Does
anyone know of any previous work?

Again, any help on this would be most appreciated!

David J. Pearce

2. Use of Cellular In The Air

3. Any Incremental Strongly Connected Component Algorithms?

4. Editing with MS Word loses theme

5. Graphs: Nontrivial strongly connected components

6. Problem installing new hard drive

7. Strongly Connect Components

8. FA: First 6 Volumes of Your Sinclair.

9. strongly k-connected components

10. Finding the circuits of a strongly connected graph

11. complexity of "strongly connected negative orientation"

12. enumeration of all strongly connected subgraphs

13. (Q) Parallel connected components problem