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

From MaRDI portal
Created claim: Wikidata QID (P12): Q62037431, #quickstatements; #temporary_batch_1712101902020
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Finding minimum-cost flows by double scaling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved Approximation Algorithms for Label Cover Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On network design problems: fixed cost flows and the covering steiner problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Beyond the flow decomposition barrier / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of finding maximum disjoint paths with length constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: On shortest disjoint paths in planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4494412 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of finding two disjoint paths with min-max objective function / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding disjoint paths with different path-costs: Complexity and algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: A quick method for finding shortest pairs of disjoint paths / rank
 
Normal rank

Revision as of 03:09, 7 July 2024

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

    Statements

    Identifiers