The permutation-path coloring problem on trees.
From MaRDI portal
Publication:1401295
DOI10.1016/S0304-3975(02)00635-7zbMath1044.68124OpenAlexW1992627018MaRDI QIDQ1401295
Sylvie Corteel, Alain Denise, Mario Valencia-Pabon, Dominique Barith, Daniéle Gardy
Publication date: 17 August 2003
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0304-3975(02)00635-7
Related Items (2)
Model-hierarchical column generation and heuristic for the routing and wavelength assignment problem ⋮ Routing permutations and involutions on optical ring networks: Complexity results and solution to an open problem
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A note on optical routing on trees
- Dynamic analysis of some relational databases parameters
- Permutations depending on the exceedance type and the number of inversions and combinatorial interpretation of a continued fraction of Heine
- Random walks, Gaussian processes and list structures
- Combinatorial aspects of continued fractions
- Eulerian graphs and related topics. Part 1, Volume 2
- Permutations selon leurs pics, creux, doubles montees et double descentes, nombres d'Euler et nombres de Genocchi
- Routing a permutation in the hypercube by two sets of edge disjoint paths
- Optimal wavelength routing on directed fiber trees
- Efficient routing in all-optical networks
- The maximum of a random walk whose mean path has a maximum
- The maximum concurrent flow problem
- On the capacity of disjointly shared networks
- The maximum of a Gaussian process whose mean path has a maximum, with an application to the strength of bundles of fibres
- Efficient algorithms for interval graphs and circular-arc graphs
- The Complexity of Coloring Circular Arcs and Chords
- Coloring a Family of Circular Arcs
- Colouring paths in directed symmetric trees with applications to WDM routing
This page was built for publication: The permutation-path coloring problem on trees.
