Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 234,975,195 papers from all fields of science
Search
Sign In
Create Free Account
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…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
24 relations
Biconnected component
Bipolar orientation
Brooks' theorem
Connectivity (graph theory)
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2013
2013
Reconfiguring Networked Infrastructures by Adding Wireless Communication Capabilities to Selected Nodes
Hengtao Wang
,
Qianchuan Zhao
,
X. Guan
,
Q. Jia
,
Li Li
IEEE Transactions on Wireless Communications
2013
Corpus ID: 12042454
Robustness is an important requirement on many critical networked infrastructures. One of the most important ways to achieve…
Expand
2012
2012
Efficient topology optimization for a wired networked system by adding wireless communication
Hengtao Wang
,
Qianchuan Zhao
,
Q. Jia
,
X. Guan
American Control Conference
2012
Corpus ID: 20514679
Adding wireless communication capabilities to networked systems can effectively improve its connectivity, which in turn improves…
Expand
2010
2010
Enumerating Rooted Biconnected Planar Graphs with Internally Triangulated Faces
Bingbing Zhuang
,
H. Nagamochi
2010
Corpus ID: 15350989
A graph is called a triangulated planar graph if it admits a plane embedding in the plane such that all inner faces are triangle…
Expand
2010
2010
Enumerating Biconnected Rooted Plane Graphs
Bingbing Zhuang
,
H. Nagamochi
2010
Corpus ID: 15921379
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…
Expand
2007
2007
Rectangular Dualization of Biconnected Plane Graphs and Related Applications
M. Ancona
,
Sara Drago
,
Gianluca Quercini
2007
Corpus ID: 122792132
Rectangular dualization is an effective visualization method for networks used in many optimization problems. However, only 4…
Expand
Review
2007
Review
2007
RECTANGULAR DUALIZATION OF BICONNECTED PLANAR GRAPHS IN LINEAR TIME AND RELATED APPLICATIONS
M. Ancona
,
Sara Drago
,
Gianluca Quercini
,
A. Bogdanovych
2007
Corpus ID: 15702450
Rectangular dualization is the computation of the rectangular dual of a planar graph. It was originally introduced to find…
Expand
2003
2003
A Parameterized Algorithm for Upward Planarity Testing of Biconnected Graphs
H. Chan
2003
Corpus ID: 1893742
We can visualize a graph by producing a geometric representation of the graph in which each node is represented by a single point…
Expand
1964
1964
On biconnected sets with dispersion points
R. Duda
1964
Corpus ID: 117869500
1960
1960
Widely connected and biconnected semigroups
P. M. Swingle
1960
Corpus ID: 6918675
We have shown in [7] that under certain assumptions both widely connected and biconnected topological semigroups exist. As point…
Expand
1937
1937
Concerning biconnected sets
E. W. Miller
1937
Corpus ID: 118570355