Sparsity-certifying graph decompositions (Q1043807): Difference between revisions

@@ Property / DOI @@
-.1007/s00373-008-0834-4
@@ Property / DOI: 10.1007/s00373-008-0834-4 / rank @@
-Normal rank
@@ Property / cites work @@
+Algorithms - ESA 2003
@@ Property / cites work: Algorithms - ESA 2003 / rank @@
+Normal rank
@@ Property / cites work @@
+Minimum partition of a matroid into independent subsets
+Normal rank
@@ Property / cites work @@
+A matroid approach to finding edge connectivity and packing arborescences
+Normal rank
@@ Property / cites work @@
+Forests, frames, and games: Algorithms for matroid sums and applications
+Normal rank
@@ Property / cites work @@
+Q5461515
@@ Property / cites work: Q5461515 / rank @@
+Normal rank
@@ Property / cites work @@
+Characterizing Sparse Graphs by Map Decompositions
+Normal rank
@@ Property / cites work @@
+Conditions for Unique Graph Realizations
@@ Property / cites work: Conditions for Unique Graph Realizations / rank @@
+Normal rank
@@ Property / cites work @@
+An algorithm for two-dimensional rigidity percolation: The pebble game
+Normal rank
@@ Property / cites work @@
+On graphs and rigidity of plane skeletal structures
+Normal rank
@@ Property / cites work @@
+Pebble game algorithms and sparse graphs
@@ Property / cites work: Pebble game algorithms and sparse graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Decomposition of Finite Graphs Into Forests
@@ Property / cites work: Decomposition of Finite Graphs Into Forests / rank @@
+Normal rank
@@ Property / cites work @@
+Q3135082
@@ Property / cites work: Q3135082 / rank @@
+Normal rank
@@ Property / cites work @@
+A Note on Finding Minimum-Cost Edge-Disjoint Spanning Trees
+Normal rank
@@ Property / cites work @@
+Combinatorial genericity and minimal rigidity
@@ Property / cites work: Combinatorial genericity and minimal rigidity / rank @@
+Normal rank
@@ Property / cites work @@
+Rigidity of multi-graphs. I: Linking rigid bodies in n-space
+Normal rank
@@ Property / cites work @@
+A new proof of Laman's theorem
@@ Property / cites work: A new proof of Laman's theorem / rank @@
+Normal rank
@@ Property / cites work @@
+On the Problem of Decomposing a Graph into <i>n</i>  Connected Factors
+Normal rank
@@ Property / cites work @@
+The Union of Matroids and the Rigidity of Frameworks
+Normal rank
@@ Property / DOI @@
+.1007/S00373-008-0834-4
@@ Property / DOI: 10.1007/S00373-008-0834-4 / rank @@
+Normal rank