54 citations · 62 across the 10 of their papers we have counts for
Showing 2016 · cs.DSShow all
2 papers · 2 filters
cs.DS2016
Space-Efficient Biconnected Components and Recognition of Outerplanar Graphs
Frank Kammer, Dieter Kratsch, Moritz Laudahn
We present space-efficient algorithms for computing cut vertices in a given graph with vertices and edges in linear time using bits. With the…
cs.DS2016
Succinct Choice Dictionaries
Torben Hagerup, Frank Kammer
The choice dictionary is introduced as a data structure that can be initialized with a parameter and subsequently maintains an initially empty subse…