Stable routing and unique-max coloring on trees

DOI10.1137/100817565MaRDI QIDQ5300484zbMATHOpenAlexFDO

Authors Nicolai Hähnle, Laura Sanità, Rico Zenklusen

Publication date 27 June 2013

Published in SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL http://hdl.handle.net/1721.1/79613

zbMATH Keywords

routing protocolsunique-max coloring

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Network design and communication in computer systems (68M10) Network protocols (68M12)

Recommendations

• Stable routing under the Spanning Tree Protocol
• Internet Routing and Related Topology Issues
• Algorithmic Applications in Management
• Computing and Combinatorics
• Stability of networks in stretchable graphs

Cited in

(3)

• Inapproximability and approximability of maximal tree routing and coloring
• Stable routing under the Spanning Tree Protocol
• scientific article; zbMATH DE number 7378671 (Why is no real title available?)

This page was built for publication: Stable routing and unique-max coloring on trees

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