Biconnected graph

Known as: Bi-connected graph 
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)
Wikipedia

Topic mentions per year

Topic mentions per year

1972-2018
0102019722018

Papers overview

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)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
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)
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
2009
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
Depth-first search, as developed by Tarjan and coauthors, is a fundamental technique of efficient algorithm design for graphs [23… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
1995
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)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
1995
1995
We present an 0 (n) time algorithm for jinding biconnected components in permutation graphs. The best known algorithm for this… (More)
  • figure 1
  • figure 2
Is this relevant?
Highly Cited
1992
Highly Cited
1992
We consider the twin problems of maintaining the bridge-connected components and the biconnected components of a dynamic… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
1991
1991
We describe two hypercube algorithms to find the biconnected components of a dense connected undirected graph. One is a modified… (More)
  • figure 3
  • table 1
  • table 2
Is this relevant?
1989
1989
* Research supported in part by the Office of Naval Research Contracts NO001486-K-0693 and NO001486-K-0419. there exists a… (More)
  • figure 1
Is this relevant?
1983
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)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?