Certificates and fast algorithms for biconnectivity in fully-dynamic graphs (Q6102299): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1007/3-540-60313-1_142
+Normal rank
@@ Property / OpenAlex ID @@
+W1572092079
@@ Property / OpenAlex ID: W1572092079 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4230327
@@ Property / cites work: Q4230327 / rank @@
+Normal rank
@@ Property / cites work @@
+Separator based sparsification for dynamic planar graph algorithms
+Normal rank
@@ Property / cites work @@
+Data Structures for On-Line Updating of Minimum Spanning Trees, with Applications
+Normal rank
@@ Property / cites work @@
+Q4234100
@@ Property / cites work: Q4234100 / rank @@
+Normal rank
@@ Property / cites work @@
+Alpha-algorithms for incremental planarity testing (preliminary version)
+Normal rank
@@ Property / cites work @@
+Q4335211
@@ Property / cites work: Q4335211 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4230326
@@ Property / cites work: Q4230326 / rank @@
+Normal rank
@@ Property / cites work @@
+Improved data structures for fully dynamic biconnectivity
+Normal rank
@@ Property / cites work @@
+Maintaining bridge-connected and biconnected components on-line
+Normal rank