Colouring paths in directed symmetric trees with applications to WDM routing

DOI10.1007/3-540-63165-8_206zbMath1401.68245OpenAlexW1512052931MaRDI 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

Mathematics Subject Classification ID

Communication networks in operations research (90B18) Graph theory (including graph drawing) in computer science (68R10) Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (11)

Optimal wavelength-routed multicasting ⋮ Forwarding and optical indices of 4-regular circulant networks ⋮ The permutation-path coloring problem on trees. ⋮ Uniform multi-hop all-to-all optical routings in rings. ⋮ The undirected optical indices of complete \(m\)-ary trees ⋮ Path problems in generalized stars, complete graphs, and brick wall graphs ⋮ The complexity of path coloring and call scheduling ⋮ Using matrices to link conflict evolution and resolution in a graph model ⋮ All-to-all communication for some wavelength-routed all-optical networks ⋮ Fractional path coloring in bounded degree trees with applications ⋮ Forwarding and optical indices of a graph

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The edge intersection graphs of paths in a tree
• Transversal theory. An account of some aspects of combinatorial mathematics
• Efficient routing in all-optical networks
• The Communication Complexity of Atomic Commitment and of Gossiping
• A survey of gossiping and broadcasting in communication networks
• All-to-all communication for some wavelength-routed all-optical networks
• On-line competitive algorithms for call admission in optical networks
• Efficient wavelength routing on directed fiber trees
• Software Libraries for Linear Algebra Computations on High Performance Computers
• Fault-tolerant broadcasting and gossiping in communication networks

This page was built for publication: Colouring paths in directed symmetric trees with applications to WDM routing