In graph theory, a biconnected graph is a connected and "nonseparable" graph, meaning that if any vertex were to be removed, the graph will remainâ€¦Â (More)

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

2010

2010

In this paper we study the time complexity of the problem Simultaneous Embedding with Fixed Edges (Sefe), that takes two planarâ€¦Â (More)

Is this relevant?

2010

2010

A plane graph is a drawing of a planar graph in the plane such that no two edges cross each other. A rooted plane graph has aâ€¦Â (More)

Is this relevant?

2009

2009

- Konstantinos Panagiotou, Angelika Steger
- SODA
- 2009

Let <i>C</i> be a class of labeled connected graphs, and let C<sub><i>n</i></sub> be a graph drawn uniformly at random fromâ€¦Â (More)

Is this relevant?

Highly Cited

2000

Highly Cited

2000

- Harold N. Gabow
- Inf. Process. Lett.
- 2000

Depth-first search, as developed by Tarjan and coauthors, is a fundamental technique of efficient algorithm design for graphs [23â€¦Â (More)

Is this relevant?

1995

1995

- Rohan F. M. Aranha, C. Pandu Rangan
- J. UCS
- 1995

Given a biconnected network G with n nodes and a speciic edge r; s o f G, the st-numbering problem asks for an assignment o f i nâ€¦Â (More)

Is this relevant?

1995

1995

- Y. Daniel Liang, Chongkye Rhee
- ACM Conference on Computer Science
- 1995

We present an 0 (n) time algorithm for jinding biconnected components in permutation graphs. The best known algorithm for thisâ€¦Â (More)

Is this relevant?

Highly Cited

1992

Highly Cited

1992

- Jeffery Westbrook, Robert E. Tarjan
- Algorithmica
- 1992

We consider the twin problems of maintaining the bridge-connected components and the biconnected components of a dynamicâ€¦Â (More)

Is this relevant?

1991

1991

- Jinwoon Woo, Sartaj Sahni
- The Journal of Supercomputing
- 1991

We describe two hypercube algorithms to find the biconnected components of a dense connected undirected graph. One is a modifiedâ€¦Â (More)

Is this relevant?

1989

1989

- Grant A. Cheston, Arthur M. Farley, Stephen T. Hedetniemi, Andrzej Proskurowski
- Inf. Process. Lett.
- 1989

* Research supported in part by the Office of Naval Research Contracts NO001486-K-0693 and NO001486-K-0419. there exists aâ€¦Â (More)

Is this relevant?

1983

1983

- J. Ebert
- Computing
- 1983

Given a biconnected graphG and two distinct verticess andt, the vertices ofG are sorted in such a way, thats is first,t is lastâ€¦Â (More)

Is this relevant?