Finding paths with minimum shared edges (Q386426): Difference between revisions

← Older edit

@@ Property / DOI @@
-.1007/s10878-012-9462-2
@@ Property / DOI: 10.1007/s10878-012-9462-2 / rank @@
-Normal rank
@@ Property / Wikidata QID @@
+Q62037431
@@ Property / Wikidata QID: Q62037431 / rank @@
+Normal rank
@@ Property / cites work @@
+Finding minimum-cost flows by double scaling
@@ Property / cites work: Finding minimum-cost flows by double scaling / rank @@
+Normal rank
@@ Property / cites work @@
+Improved Approximation Algorithms for Label Cover Problems
+Normal rank
@@ Property / cites work @@
+On network design problems: fixed cost flows and the covering steiner problem
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Beyond the flow decomposition barrier
@@ Property / cites work: Beyond the flow decomposition barrier / rank @@
+Normal rank
@@ Property / cites work @@
+The complexity of finding maximum disjoint paths with length constraints
+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 @@
+Q4494412
@@ Property / cites work: Q4494412 / rank @@
+Normal rank
@@ Property / cites work @@
+The complexity of finding two disjoint paths with min-max objective function
+Normal rank
@@ Property / cites work @@
+Finding disjoint paths with different path-costs: Complexity and algorithms
+Normal rank
@@ Property / cites work @@
+A quick method for finding shortest pairs of disjoint paths
+Normal rank
@@ Property / DBLP publication ID @@
+journals/jco/OmranSZ13
@@ Property / DBLP publication ID: journals/jco/OmranSZ13 / rank @@
+Normal rank
@@ Property / DOI @@
+.1007/S10878-012-9462-2
@@ Property / DOI: 10.1007/S10878-012-9462-2 / rank @@
+Normal rank
@@ Property / Recommended article @@
+Finding Paths with Minimum Shared Edges
@@ Property / Recommended article: Finding Paths with Minimum Shared Edges / rank @@
+Normal rank
+Similarity Score: 1.0000002Amount 1.0000002
Unit 1
-Amount
+.0000002
 Unit
+Recommender Run: Recommender Run 2
@@ Property / Recommended article @@
+On finding Min-Min disjoint paths
@@ Property / Recommended article: On finding Min-Min disjoint paths / rank @@
+Normal rank
@@ Property / Recommended article: On finding Min-Min disjoint paths / qualifier @@
+Similarity Score: 0.90225863Amount 0.90225863
Unit 1
-Amount
+.90225863
 Unit
@@ Property / Recommended article: On finding Min-Min disjoint paths / qualifier @@
+Recommender Run: Recommender Run 2
@@ Property / Recommended article @@
+Q4297298
@@ Property / Recommended article: Q4297298 / rank @@
+Normal rank
@@ Property / Recommended article: Q4297298 / qualifier @@
+Similarity Score: 0.8939919Amount 0.8939919
Unit 1
-Amount
+.8939919
 Unit
@@ Property / Recommended article: Q4297298 / qualifier @@
+Recommender Run: Recommender Run 2
@@ Property / Recommended article @@
+Finding the Minimum-Weight k-Path
@@ Property / Recommended article: Finding the Minimum-Weight k-Path / rank @@
+Normal rank
@@ Property / Recommended article: Finding the Minimum-Weight k-Path / qualifier @@
+Similarity Score: 0.88579136Amount 0.88579136
Unit 1
-Amount
+.88579136
 Unit
@@ Property / Recommended article: Finding the Minimum-Weight k-Path / qualifier @@
+Recommender Run: Recommender Run 2
@@ Property / Recommended article @@
+Q3351166
@@ Property / Recommended article: Q3351166 / rank @@
+Normal rank
@@ Property / Recommended article: Q3351166 / qualifier @@
+Similarity Score: 0.88413227Amount 0.88413227
Unit 1
-Amount
+.88413227
 Unit
@@ Property / Recommended article: Q3351166 / qualifier @@
+Recommender Run: Recommender Run 2
@@ Property / Recommended article @@
+Minimum-link paths revisited
@@ Property / Recommended article: Minimum-link paths revisited / rank @@
+Normal rank
@@ Property / Recommended article: Minimum-link paths revisited / qualifier @@
+Similarity Score: 0.88381827Amount 0.88381827
Unit 1
-Amount
+.88381827
 Unit
@@ Property / Recommended article: Minimum-link paths revisited / qualifier @@
+Recommender Run: Recommender Run 2
@@ Property / Recommended article @@
+Q3108686
@@ Property / Recommended article: Q3108686 / rank @@
+Normal rank
@@ Property / Recommended article: Q3108686 / qualifier @@
+Similarity Score: 0.88226116Amount 0.88226116
Unit 1
-Amount
+.88226116
 Unit
@@ Property / Recommended article: Q3108686 / qualifier @@
+Recommender Run: Recommender Run 2
@@ Property / Recommended article @@
+Finding Minors in Graphs with a Given Path Structure
+Normal rank
+Similarity Score: 0.87931705Amount 0.87931705
Unit 1
-Amount
+.87931705
 Unit
+Recommender Run: Recommender Run 2
@@ Property / Recommended article @@
+Graph path minimization problem
@@ Property / Recommended article: Graph path minimization problem / rank @@
+Normal rank
@@ Property / Recommended article: Graph path minimization problem / qualifier @@
+Similarity Score: 0.8783016Amount 0.8783016
Unit 1
-Amount
+.8783016
 Unit
@@ Property / Recommended article: Graph path minimization problem / qualifier @@
+Recommender Run: Recommender Run 2
@@ Property / Recommended article @@
+Finding the shortest paths by node combination
+Normal rank
+Similarity Score: 0.87779224Amount 0.87779224
Unit 1
-Amount
+.87779224
 Unit
+Recommender Run: Recommender Run 2