Colouring paths in directed symmetric trees with applications to WDM routing

DOI10.1007/3-540-63165-8_206MaRDI QIDQ4571981zbMATH OpenOpenAlexFDO

Authors Stéphane Pérennes, Luisa Gargano, Pavol Hell

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

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

Recommendations

• Coloring all directed paths in a symmetric tree, with an application to optical networks
• Approximation Algorithms for Path Coloring in Trees
• Efficient wavelength routing on directed fiber trees
• scientific article; zbMATH DE number 1754632
• A memetic algorithm to schedule planned maintenance for the national grid

Cites work

• scientific article; zbMATH DE number 1003273 (Why is no real title available?)
• scientific article; zbMATH DE number 3859178 (Why is no real title available?)
• scientific article; zbMATH DE number 51132 (Why is no real title available?)
• scientific article; zbMATH DE number 1306887 (Why is no real title available?)
• scientific article; zbMATH DE number 2102779 (Why is no real title available?)
• scientific article; zbMATH DE number 857072 (Why is no real title available?)
• scientific article; zbMATH DE number 910915 (Why is no real title available?)
• A survey of gossiping and broadcasting in communication networks
• All-to-all communication for some wavelength-routed all-optical networks
• Efficient routing in all-optical networks
• Efficient wavelength routing on directed fiber trees
• Fault-tolerant broadcasting and gossiping in communication networks
• Graph theory with applications
• On-line competitive algorithms for call admission in optical networks
• Software Libraries for Linear Algebra Computations on High Performance Computers
• The Communication Complexity of Atomic Commitment and of Gossiping
• The edge intersection graphs of paths in a tree
• Transversal theory. An account of some aspects of combinatorial mathematics

Cited in

(18)

• Forwarding and optical indices of 4-regular circulant networks
• Forwarding and optical indices of a graph
• Solving coloring, minimum clique cover and kernel problems on arc intersection graphs of directed paths on a tree
• A \(\frac{5}{2}\)-approximation algorithm for coloring rooted subtrees of a degree 3 tree
• The complexity of path coloring and call scheduling
• Coloring all directed paths in a symmetric tree, with an application to optical networks
• scientific article; zbMATH DE number 1754632 (Why is no real title available?)
• Path problems in generalized stars, complete graphs, and brick wall graphs
• WDM and directed star arboricity
• Optimal wavelength-routed multicasting
• Fractional path coloring in bounded degree trees with applications
• The permutation-path coloring problem on trees.
• scientific article; zbMATH DE number 6381717 (Why is no real title available?)
• Using matrices to link conflict evolution and resolution in a graph model
• Uniform multi-hop all-to-all optical routings in rings.
• The undirected optical indices of complete \(m\)-ary trees
• scientific article; zbMATH DE number 5990404 (Why is no real title available?)
• All-to-all communication for some wavelength-routed all-optical networks

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4571981)