Sparse graph certificates for mixed connectivity (Q1781979): Difference between revisions

@@ Property / author @@
-Ottilia Fülöp
@@ Property / author: Ottilia Fülöp / rank @@
-Normal rank
@@ Property / author @@
+Ottilia Fülöp
@@ Property / author: Ottilia Fülöp / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.disc.2004.11.011
+Normal rank
@@ Property / OpenAlex ID @@
+W2169333450
@@ Property / OpenAlex ID: W2169333450 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3852212
@@ Property / cites work: Q3852212 / rank @@
+Normal rank
@@ Property / cites work @@
+Scan-First Search and Sparse Certificates: An Improved Parallel Algorithm for <i>k</i>-Vertex Connectivity
+Normal rank
@@ Property / cites work @@
+On mixed connectivity certificates
@@ Property / cites work: On mixed connectivity certificates / rank @@
+Normal rank
@@ Property / cites work @@
+On sparse subgraphs preserving connectivity properties
+Normal rank
@@ Property / cites work @@
+A theorem on n-connected graphs
@@ Property / cites work: A theorem on n-connected graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Minimally n-line connected graphs.
@@ Property / cites work: Minimally n-line connected graphs. / rank @@
+Normal rank
@@ Property / cites work @@
+Existenz gewisser Konfigurationen in \(n\)-gesättigten Graphen und in Graphen genügend großer Kantendichte
+Normal rank
@@ Property / cites work @@
+A linear-time algorithm for finding a sparse \(k\)-connected spanning subgraph of a \(k\)-connected graph
+Normal rank
@@ Property / cites work @@
+\(k\)-connectivity and decomposition of graphs into forests
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:1781979