Graph Minors and Reliable Single Message Transmission

DOI10.1137/S0895480103421129zbMath1102.68009OpenAlexW2012995118MaRDI QIDQ5470796

André Kündgen, Radhika Ramamurthi, Michael J. Pelsmajer, Faith E. Fich

Publication date: 1 June 2006

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

Full work available at URL: https://doi.org/10.1137/s0895480103421129

zbMATH Keywords

tree decompositiontree-widthgraph minorsend-to-end communicationreliable transmission

Mathematics Subject Classification ID

Applications of graph theory (05C90) Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Graph minors (05C83) Graph algorithms (graph-theoretic aspects) (05C85) Applications of graph theory to circuits and networks (94C15)

Related Items (4)

Strengthening Hadwiger's conjecture for 4- and 5-chromatic graphs ⋮ Equitable list coloring and treewidth ⋮ Expected reliability of communication protocols ⋮ Finding Minors in Graphs with a Given Path Structure

This page was built for publication: Graph Minors and Reliable Single Message Transmission