# Series-parallel graph

## Papers overview

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

2006

2006

- Discrete Mathematics
- 2006

The three well-known graph classes, planar graphs( P), series-parallel graphs ( SP) and outer planar graphs( OP) satisfy theâ€¦Â (More)

Is this relevant?

2006

2006

- Informatica
- 2006

Bargaining with reading habit is no need. Reading is not kind of something sold that you can take or not. It is a thing that willâ€¦Â (More)

Is this relevant?

2003

2003

- Discrete Applied Mathematics
- 2003

A graph is called equistable when there is a non-negative weight function on its vertices such that a set S of vertices has totalâ€¦Â (More)

Is this relevant?

2003

2003

- Algorithmica
- 2003

Let G be a graph, and let each vertex v of G have a positive integer weight Ï‰(v). A multicoloring of G is to assign each vertex vâ€¦Â (More)

Is this relevant?

Highly Cited

2003

Highly Cited

2003

- 2003

There is a simple type of electric network termed a series-parallel connection which occurs frequently in both theoretical andâ€¦Â (More)

Is this relevant?

Highly Cited

1996

Highly Cited

1996

- IEEE Trans. Reliability
- 1996

& Conclusions-A problem specific genetic algorithm (GA) is developed and demonstrated to analyze series-parallel systems and toâ€¦Â (More)

Is this relevant?

1996

1996

- Discrete Mathematics
- 1996

By applying a sequence of edge-gluings on a set of cycles each of length k, we obtain a special series-parallel graph. The wellâ€¦Â (More)

Is this relevant?

1996

1996

- ESA
- 1996

In this paper, a parallel algorithm is given that, given a graph G = (V;E), decides whetherG is a series parallel graph, and ifâ€¦Â (More)

Is this relevant?

Highly Cited

1992

Highly Cited

1992

- Inf. Comput.
- 1992

Recently, He and Yesha gave an algorithm for recognizing directed series parallel graphs, in time O(log n) with linearly manyâ€¦Â (More)

Is this relevant?

Highly Cited

1982

Highly Cited

1982

- J. ACM
- 1982

A series-parallel graph can be constructed from a certain graph by recurslvely applying "series" and "parallel" connections Theâ€¦Â (More)

Is this relevant?