Randomized path coloring on binary trees.

DOI10.1016/S0304-3975(01)00310-3zbMath1061.68119MaRDI QIDQ1853533

Christos Kaklamanis, Vincenzo Auletta, Ioannis Caragiannis, Pino Persiano

Publication date: 21 January 2003

Published in: Theoretical Computer Science (Search for Journal in Brave)

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items

Path problems in generalized stars, complete graphs, and brick wall graphs

Cites Work

• Weighted sums of certain dependent random variables
• Efficient routing in all-optical networks
• Constrained bipartite edge coloring with applications to wavelength routing
• Efficient wavelength routing on directed fiber trees
• Tail bounds for occupancy and the satisfiability threshold conjecture
• Probability Inequalities for Sums of Bounded Random Variables
• A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item