# Strongly connected component

## Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

2013

2013

- SODA
- 2013

We consider the problem of maintaining the strongly connected components (SCCs) of an n-nodes and medges directed graph thatâ€¦Â (More)

Is this relevant?

Highly Cited

2012

Highly Cited

2012

- Automatica
- 2012

We study the average consensus problem of multi-agent syste ms for general network topologies with unidirectional informationâ€¦Â (More)

Is this relevant?

Highly Cited

2011

Highly Cited

2011

- IEEE International Parallel & Distributedâ€¦
- 2011

The problem of decomposing a directed graph into its strongly connected components is a fundamental graph problem inherentlyâ€¦Â (More)

Is this relevant?

2008

2008

- 2008

This paper presents the method of a parallel implementation of Tarjanâ€™s algorithm that solves an important problem of detectionâ€¦Â (More)

Is this relevant?

2005

2005

- J. Parallel Distrib. Comput.
- 2005

The traditional, serial, algorithm for finding the strongly connected components in a graph is based on depth first search andâ€¦Â (More)

Is this relevant?

Highly Cited

2003

Highly Cited

2003

- SODA
- 2003

We present an algorithm that computes in a linear number of symbolic steps (<i>O</i>(|<i>V</i>|)) the strongly connectedâ€¦Â (More)

Is this relevant?

Highly Cited

2000

Highly Cited

2000

- IPDPS Workshops
- 2000

The standard serial algorithm for strongly connected components is based on depth rst search, which is di cult to parallelize. Weâ€¦Â (More)

Is this relevant?

1999

1999

- IEEE/ACM International Conference on Computerâ€¦
- 1999

This paper presents a BDD-based implicit algorithm to compute all maximal strongly connected components of directed graphs. Theâ€¦Â (More)

Is this relevant?

Highly Cited

1997

Highly Cited

1997

- 1997

In this paper we present a CTL-like logic which is interpreted over the state spaces of Coloured Petri Nets. The logic has beenâ€¦Â (More)

Is this relevant?

Highly Cited

1994

Highly Cited

1994

- Inf. Process. Lett.
- 1994

We present two improved versions of Tarjan's algorithm for the detection of strongly connected components in a directed graphâ€¦Â (More)

Is this relevant?