Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 234,150,762 papers from all fields of science
Search
Sign In
Create Free Account
SPQR tree
Known as:
SPQR (disambiguation)
, Triconnected component
, Spqr decomposition
Expand
In graph theory, a branch of mathematics, the triconnected components of a biconnected graph are a system of smaller graphs that describe all of the…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
28 relations
1-planar graph
Apex graph
Biconnected component
Biconnected graph
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2019
2019
NodeTrix Planarity Testing with Small Clusters
Emilio Di Giacomo
,
G. Liotta
,
M. Patrignani
,
Ignaz Rutter
,
Alessandra Tappini
Algorithmica
2019
Corpus ID: 254030700
We study the NodeTrix planarity testing problem for flat clustered graphs when the maximum size of each cluster is bounded by a…
Expand
2017
2017
1 An Indexing Framework for eries on Probabilistic Graphs
Silviu Maniu
,
Reynold Cheng
2017
Corpus ID: 52088929
Information in many applications, such as mobile wireless systems, social networks, and road networks, is captured by graphs. In…
Expand
2017
2017
A SPQR-Tree Decomposition Technique for Efficient Cloud Inter-Domain Execution
Ramón Alcarria
,
Diego Martín
,
Tomás Robles
,
M. Manso
2017
Corpus ID: 64355897
The challenge of workflow distribution has been recently addressed in the fields of grid computing, task delegation and cross…
Expand
2016
2016
On the logspace shortest path problem
Boris Brimkov
,
Illya V. Hicks
Electron. Colloquium Comput. Complex.
2016
Corpus ID: 2413281
In this paper, we reduce the logspace shortest path problem to biconnected graphs; in particular, we present a logspace shortest…
Expand
2009
2009
Convex Drawings of Internally Triconnected Plane Graphs on O(N2) Grids
Xiaoping Zhou
,
Takao Nishizeki
Discret. Math. Algorithms Appl.
2009
Corpus ID: 18671965
In a convex grid drawing of a plane graph, every edge is drawn as a straight-line segment without any edge-intersection, every…
Expand
2008
2008
Algorithms for Planar Graph Augmentation
Bernd Zey
2008
Corpus ID: 16673095
Acknowledgement The reader may forgive me for writing this Short Abstract This diploma thesis deals with several special cases of…
Expand
2007
2007
Drawing Planar Clustered Graphs in 2 . 5 Dimensions
Martin Mader
,
Seok-Hee Hong
2007
Corpus ID: 13486240
Clustering techniques have proven to be useful in reducing the complexity of large networks. We present a method for drawing a…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE