Biconnected component

Known as: Cut node, Articulation, Articulation Points 
In graph theory, a biconnected component (also known as a block or 2-connected component) is a maximal biconnected subgraph. Any connected graph… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1938-2017
020040019382016

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2008
Highly Cited
2008
  • E. Cotrs Cmm
  • 2008
In the first tests that were conducted with the speech synthesizer, the synthesized speech was judged to be unnatural in… (More)
Is this relevant?
Highly Cited
2008
Highly Cited
2008
Both detection and tracking people are challenging problems, especially in complex real world scenes that commonly involve… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2002
2002
In this paper, a self-stabilizing algorithm is presented for finding biconnected components of a connected undirected graph on a… (More)
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
Highly Cited
2000
Highly Cited
2000
The main challenge in articulated body motion tracking is the large number of degrees of freedom (around 30) to be recovered… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1996
Highly Cited
1996
We consider the problem of maintaining on-line the triconnected components of a graphG. Letn be the current number of vertices… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
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?
Highly Cited
1992
Highly Cited
1992
The topic of Computer Supported Cooperative Work (CSCW) has attracted much attention in the last few years. While the field is… (More)
Is this relevant?
1990
1990
A central problem for distributed systems is to achieve global knowledge from the individual local information of its processors… (More)
  • figure 1
  • figure 3
  • figure 2
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1984
Highly Cited
1984
In this paper we propose a new algorithm for finding the blocks (biconnected components) of an undirected graph. A serial… (More)
  • figure 1
  • figure 2
Is this relevant?
Highly Cited
1975
Highly Cited
1975
CJI A C i s an udaptive system by which control .functims JOT many degrees offreedom operating sirnulfaneously can be compuied by… (More)
  • figure 1
  • figure 2
  • table 1
  • table 4
  • table 5
Is this relevant?