Shortest \((A+B)\)-path packing via hafnian (Q724248): Difference between revisions

@@ Property / DOI @@
-.1007/s00453-017-0334-0
@@ Property / DOI: 10.1007/s00453-017-0334-0 / rank @@
-Normal rank
@@ Property / OpenAlex ID @@
+W2963286134
@@ Property / OpenAlex ID: W2963286134 / rank @@
+Normal rank
@@ Property / arXiv ID @@
+.08073
@@ Property / arXiv ID: 1603.08073 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5743447
@@ Property / cites work: Q5743447 / 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 @@
+Shortest vertex-disjoint two-face paths in planar graphs
+Normal rank
@@ Property / cites work @@
+Maximum-Minimum Sätze und verallgemeinerte Faktoren von Graphen
+Normal rank
@@ Property / cites work @@
+Tree metrics and edge-disjoint \(S\)-paths
@@ Property / cites work: Tree metrics and edge-disjoint \(S\)-paths / rank @@
+Normal rank
@@ Property / cites work @@
+On shortest disjoint paths in planar graphs
@@ Property / cites work: On shortest disjoint paths in planar graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Finding a shortest non-zero path in group-labeled graphs via permanent computation
+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 @@
+Graph minors. XIII: The disjoint paths problem
@@ Property / cites work: Graph minors. XIII: The disjoint paths problem / rank @@
+Normal rank
@@ Property / cites work @@
+Disjoint paths in graphs
@@ Property / cites work: Disjoint paths in graphs / rank @@
+Normal rank
@@ Property / cites work @@
+A Polynomial Solution to the Undirected Two Paths Problem
+Normal rank
@@ Property / cites work @@
+-linked graphs
@@ Property / cites work: 2-linked 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 @@
+Shortest Disjoint S-Paths Via Weighted Linear Matroid Parity
+Normal rank
@@ Property / DOI @@
+.1007/S00453-017-0334-0
@@ Property / DOI: 10.1007/S00453-017-0334-0 / rank @@
+Normal rank