Finding a shortest non-zero path in group-labeled graphs via permanent computation (Q524371): Difference between revisions

@@ Property / OpenAlex ID @@
+W2295069807
@@ Property / OpenAlex ID: W2295069807 / rank @@
+Normal rank
@@ Property / cites work @@
+On a routing problem
@@ Property / cites work: On a routing problem / rank @@
+Normal rank
@@ Property / cites work @@
+Shortest Two Disjoint Paths in Polynomial Time
@@ Property / cites work: Shortest Two Disjoint Paths in Polynomial Time / rank @@
+Normal rank
@@ Property / cites work @@
+A note on two problems in connexion with graphs
@@ Property / cites work: A note on two problems in connexion with graphs / rank @@
+Normal rank
@@ Property / cites work @@
+An algebraic matching algorithm
@@ Property / cites work: An algebraic matching algorithm / rank @@
+Normal rank
@@ Property / cites work @@
+Generating all graph coverings by permutation voltage assignments
+Normal rank
@@ Property / cites work @@
+Q3757929
@@ Property / cites work: Q3757929 / rank @@
+Normal rank
@@ Property / cites work @@
+Weakly bipartite graphs and the max-cut problem
@@ Property / cites work: Weakly bipartite graphs and the max-cut problem / rank @@
+Normal rank
@@ Property / cites work @@
+The even-path problem for graphs and digraphs
@@ Property / cites work: The even-path problem for graphs and digraphs / rank @@
+Normal rank
@@ Property / cites work @@
+Matching is as easy as matrix inversion
@@ Property / cites work: Matching is as easy as matrix inversion / rank @@
+Normal rank
@@ Property / cites work @@
+Combinatorial optimization. Polyhedra and efficiency (3 volumes)
+Normal rank
@@ Property / cites work @@
+The Factorization of Linear Graphs
@@ Property / cites work: The Factorization of Linear Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+The complexity of computing the permanent
@@ Property / cites work: The complexity of computing the permanent / rank @@
+Normal rank
@@ Property / cites work @@
+Biased graphs. I: Bias, balance, and gains
@@ Property / cites work: Biased graphs. I: Bias, balance, and gains / rank @@
+Normal rank