A Linear Time Implementation of SPQR-Trees

By Carsten Gutwenger, Petra Mutzel. International Symposium Graph Drawing and Network Visualization, 2000

295 citations recorded by the source corpus.

Subfields: Computer Networks and Communications, Electrical and Electronic Engineering

View Paper: https://www.semanticscholar.org/paper/974b7392a2f41bd0eb15906d2fc310455be81aba

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Computer Networks and Communications

1. A. Manteuffel
2. C. Studerus
3. Gudrun Heinrich
4. L. Tancredi
5. R. N. Lee
6. Tiziano Peraro
7. Ettore Remiddi
8. Roman N. Lee

In Electrical and Electronic Engineering

1. C. Studerus
2. A. Manteuffel

Citations in the corpus

• Reduze 2 - Distributed Feynman Integral Reduction (2012, methodology): “d into biconnected components with the algorithm [31]. Possible separation pairs of biconnected components are identified via a decomposition into triconnected components. We implemented the algorithm [32, 33] for this purpose. In order to generate at least one representative for each graph isomorphi”
• The refined process structure tree (2008, unknown): “Gutwenger and Mutzel [2] present some corrections to this algorithm.”