SPQR tree

Known as: SPQR (disambiguation), Triconnected component, Spqr decomposition

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…

Papers overview

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

2019

We study the NodeTrix planarity testing problem for flat clustered graphs when the maximum size of each cluster is bounded by a…

2018

We propose faster algorithms for the maximum flow problem and related problems based on graph decomposition. Our algorithms first…

2017

Information in many applications, such as mobile wireless systems, social networks, and road networks, is captured by graphs. In…

2016

In this paper, we reduce the logspace shortest path problem to biconnected graphs; in particular, we present a logspace shortest…

2014

In a convex drawing of a plane graph, all edges are drawn as straight-line segments without any edge-intersection and all facial…

2009

In a convex grid drawing of a plane graph, every edge is drawn as a straight-line segment without any edge-intersection, every…

2007

Clustering techniques have proven to be useful in reducing the complexity of large networks. We present a method for drawing a…

2004

This article describes a software development toolkit for programming mobile robots, that has been used on different platforms…

1994

1992

Sacks and Doyle have done the A1 community a service by spelling out the limitations of the qualitative physics/reasoning…