Colouring paths in directed symmetric trees with applications to WDM routing
From MaRDI portal
Publication:4571981
DOI10.1007/3-540-63165-8_206zbMath1401.68245MaRDI QIDQ4571981
Stéphane Pérennes, Pavol Hell, Luisa Gargano
Publication date: 4 July 2018
Published in: Automata, Languages and Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/3-540-63165-8_206
90B18: Communication networks in operations research
68R10: Graph theory (including graph drawing) in computer science
05C15: Coloring of graphs and hypergraphs
05C85: Graph algorithms (graph-theoretic aspects)
Related Items
The complexity of path coloring and call scheduling, Fractional path coloring in bounded degree trees with applications, Using matrices to link conflict evolution and resolution in a graph model, Forwarding and optical indices of a graph, Optimal wavelength-routed multicasting, The permutation-path coloring problem on trees., Uniform multi-hop all-to-all optical routings in rings., Path problems in generalized stars, complete graphs, and brick wall graphs, Unnamed Item