Progress on certifying algorithms

Authors:
Kurt Mehlhorn;Pascal Schweitzer
Affiliations:
Max-Planck-Institut für Informatik, Saarbrücken, Germany;Max-Planck-Institut für Informatik, Saarbrücken, Germany
Venue:
FAW'10 Proceedings of the 4th international conference on Frontiers in algorithmics
Year:
2010

Citing 1
Cited 2

A Linear Time Implementation of SPQR-Trees

GD '00 Proceedings of the 8th International Symposium on Graph Drawing

Certifying 3-connectivity in linear time

ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part I
Every DFS Tree of a 3-Connected Graph Contains a Contractible Edge

Journal of Graph Theory

Quantified Score

Hi-index	0.01

Visualization

Abstract