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

From MaRDI portal
ReferenceBot (talk | contribs)
Changed an Item
Import recommendations run Q6767936
 
(3 intermediate revisions by 3 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s10878-012-9462-2 / rank
Normal rank
 
Property / DBLP publication ID
 
Property / DBLP publication ID: journals/jco/OmranSZ13 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S10878-012-9462-2 / rank
 
Normal rank
Property / Recommended article
 
Property / Recommended article: Finding Paths with Minimum Shared Edges / rank
 
Normal rank
Property / Recommended article: Finding Paths with Minimum Shared Edges / qualifier
 
Similarity Score: 1.0000002
Amount1.0000002
Unit1
Property / Recommended article: Finding Paths with Minimum Shared Edges / qualifier
 
Property / Recommended article
 
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.90225863
Amount0.90225863
Unit1
Property / Recommended article: On finding Min-Min disjoint paths / qualifier
 
Property / Recommended article
 
Property / Recommended article: Q4297298 / rank
 
Normal rank
Property / Recommended article: Q4297298 / qualifier
 
Similarity Score: 0.8939919
Amount0.8939919
Unit1
Property / Recommended article: Q4297298 / qualifier
 
Property / Recommended article
 
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.88579136
Amount0.88579136
Unit1
Property / Recommended article: Finding the Minimum-Weight k-Path / qualifier
 
Property / Recommended article
 
Property / Recommended article: Q3351166 / rank
 
Normal rank
Property / Recommended article: Q3351166 / qualifier
 
Similarity Score: 0.88413227
Amount0.88413227
Unit1
Property / Recommended article: Q3351166 / qualifier
 
Property / Recommended article
 
Property / Recommended article: Minimum-link paths revisited / rank
 
Normal rank
Property / Recommended article: Minimum-link paths revisited / qualifier
 
Similarity Score: 0.88381827
Amount0.88381827
Unit1
Property / Recommended article: Minimum-link paths revisited / qualifier
 
Property / Recommended article
 
Property / Recommended article: Q3108686 / rank
 
Normal rank
Property / Recommended article: Q3108686 / qualifier
 
Similarity Score: 0.88226116
Amount0.88226116
Unit1
Property / Recommended article: Q3108686 / qualifier
 
Property / Recommended article
 
Property / Recommended article: Finding Minors in Graphs with a Given Path Structure / rank
 
Normal rank
Property / Recommended article: Finding Minors in Graphs with a Given Path Structure / qualifier
 
Similarity Score: 0.87931705
Amount0.87931705
Unit1
Property / Recommended article: Finding Minors in Graphs with a Given Path Structure / qualifier
 
Property / Recommended article
 
Property / Recommended article: Graph path minimization problem / rank
 
Normal rank
Property / Recommended article: Graph path minimization problem / qualifier
 
Similarity Score: 0.8783016
Amount0.8783016
Unit1
Property / Recommended article: Graph path minimization problem / qualifier
 
Property / Recommended article
 
Property / Recommended article: Finding the shortest paths by node combination / rank
 
Normal rank
Property / Recommended article: Finding the shortest paths by node combination / qualifier
 
Similarity Score: 0.87779224
Amount0.87779224
Unit1
Property / Recommended article: Finding the shortest paths by node combination / qualifier
 

Latest revision as of 19:23, 4 April 2025

scientific article
Language Label Description Also known as
English
Finding paths with minimum shared edges
scientific article

    Statements

    Finding paths with minimum shared edges (English)
    0 references
    0 references
    0 references
    0 references
    9 December 2013
    0 references
    minimum shared edges problem
    0 references
    approximation algorithm
    0 references
    inapproximability
    0 references
    heuristic algorithms
    0 references

    Identifiers