Colouring paths in directed symmetric trees with applications to WDM routing

DOI10.1007/3-540-63165-8_206zbMATH Open1401.68245OpenAlexW1512052931MaRDI QIDQ4571981FDOQ4571981

Pavol Hell, Stéphane Pérennes, 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

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)

Cites Work

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

Cited In (13)

• Forwarding and optical indices of 4-regular circulant networks
• Forwarding and optical indices of a graph
• The complexity of path coloring and call scheduling
• Path problems in generalized stars, complete graphs, and brick wall graphs
• Optimal wavelength-routed multicasting
• Fractional path coloring in bounded degree trees with applications
• The permutation-path coloring problem on trees.
• Title not available (Why is that?)
• 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
• Title not available (Why is that?)
• 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)