The Simple Reachability Problem in Switch Graphs (Q3599094): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1007/978-3-540-95891-8_42
+Normal rank
@@ Property / OpenAlex ID @@
+W1534370504
@@ Property / OpenAlex ID: W1534370504 / rank @@
+Normal rank
@@ Property / cites work @@
+Isolation, matching, and counting uniform and nonuniform upper bounds
+Normal rank
@@ Property / cites work @@
+General factors of graphs
@@ Property / cites work: General factors of graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Paths, Trees, and Flowers
@@ Property / cites work: Paths, Trees, and Flowers / rank @@
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
+Normal rank
@@ Property / cites work @@
+Space-bounded reducibility among combinatorial problems
+Normal rank
@@ Property / cites work @@
+On the Complexity of General Graph Factor Problems
+Normal rank
@@ Property / cites work @@
+The factorization of graphs. II
@@ Property / cites work: The factorization of graphs. II / rank @@
+Normal rank
@@ Property / cites work @@
+Undirected ST-connectivity in log-space
@@ Property / cites work: Undirected ST-connectivity in log-space / rank @@
+Normal rank