The permutation-path coloring problem on trees. (Q1401295): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q4886092 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Permutations depending on the exceedance type and the number of inversions and combinatorial interpretation of a continued fraction of Heine / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198785 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The maximum of a Gaussian process whose mean path has a maximum, with an application to the strength of bundles of fibres / rank
 
Normal rank
Property / cites work
 
Property / cites work: The maximum of a random walk whose mean path has a maximum / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal wavelength routing on directed fiber trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial aspects of continued fractions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Eulerian graphs and related topics. Part 1, Volume 2 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Permutations selon leurs pics, creux, doubles montees et double descentes, nombres d'Euler et nombres de Genocchi / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic analysis of some relational databases parameters / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Coloring Circular Arcs and Chords / rank
 
Normal rank
Property / cites work
 
Property / cites work: Colouring paths in directed symmetric trees with applications to WDM routing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3328583 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Routing a permutation in the hypercube by two sets of edge disjoint paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient algorithms for interval graphs and circular-arc graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on optical routing on trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the capacity of disjointly shared networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random walks, Gaussian processes and list structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: The maximum concurrent flow problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient routing in all-optical networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coloring a Family of Circular Arcs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3715122 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4250199 / rank
 
Normal rank

Latest revision as of 09:49, 6 June 2024

scientific article
Language Label Description Also known as
English
The permutation-path coloring problem on trees.
scientific article

    Statements

    The permutation-path coloring problem on trees. (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    17 August 2003
    0 references
    0 references
    Average-case complexity
    0 references
    Routing permutation
    0 references
    Path coloring
    0 references
    Tree networks
    0 references
    NP-completeness
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references