On matroids and hierarchical graphs (Q1178207): Difference between revisions

@@ Property / author @@
+David Fernández Baca
@@ Property / author: David Fernández Baca / 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/0020-0190(91)90232-7
+Normal rank
@@ Property / OpenAlex ID @@
+W2058122596
@@ Property / OpenAlex ID: W2058122596 / rank @@
+Normal rank
@@ Property / cites work @@
+Efficient algorithms for finding minimum spanning trees in undirected and directed graphs
+Normal rank
@@ Property / cites work @@
+A linear-time algorithm for finding a minimum spanning pseudoforest
+Normal rank
@@ Property / cites work @@
+Succinct representations of graphs
@@ Property / cites work: Succinct representations of graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q4130999
@@ Property / cites work: Q4130999 / rank @@
+Normal rank
@@ Property / cites work @@
+Efficient algorithms for finding minimum spanning forests of hierarchically defined graphs
+Normal rank
@@ Property / cites work @@
+Q3759947
@@ Property / cites work: Q3759947 / rank @@
+Normal rank
@@ Property / cites work @@
+Efficient Solution of Connectivity Problems on Hierarchically Defined Graphs
+Normal rank
@@ Property / cites work @@
+Infinite subgraphs as matroid circuits
@@ Property / cites work: Infinite subgraphs as matroid circuits / rank @@
+Normal rank
@@ Property / cites work @@
+Q3338297
@@ Property / cites work: Q3338297 / rank @@
+Normal rank
@@ Property / cites work @@
+The complexity of combinatorial problems with succinct input representation
+Normal rank
@@ Property / cites work @@
+Q4111952
@@ Property / cites work: Q4111952 / rank @@
+Normal rank
@@ Property / Wikidata QID @@
+Q126322022
@@ Property / Wikidata QID: Q126322022 / rank @@
+Normal rank