The complexity of finding maximum disjoint paths with length constraints (Q4741713): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Added link to MaRDI item.
links / mardi / namelinks / mardi / name
 

Revision as of 23:08, 7 February 2024

scientific article; zbMATH DE number 3795372
Language Label Description Also known as
English
The complexity of finding maximum disjoint paths with length constraints
scientific article; zbMATH DE number 3795372

    Statements

    The complexity of finding maximum disjoint paths with length constraints (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    1982
    0 references
    undirected graph
    0 references
    disjoint paths
    0 references
    NP-completeness
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references