Communication tree problems
From MaRDI portal
Publication:995575
DOI10.1016/j.tcs.2007.04.038zbMath1188.68354OpenAlexW1981869853MaRDI QIDQ995575
Rafel Cases, Jordi Petit, Carme Àlvarez, Maria J. Serna, Josep Diaz
Publication date: 3 September 2007
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/2117/97656
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Compressions and isoperimetric inequalities
- Call routing and the ratcatcher
- Approximating Layout Problems on Random Geometric Graphs
- Optimum Communication Spanning Trees
- Constrained Optimum Communication Trees and Sensitivity Analysis
- A variation on the min cut linear arrangement problem
- A Separator Theorem for Planar Graphs
- The complexity of the network design problem
- A survey of solved problems and applications on bandwidth, edgesum, and profile of graphs
- Some results on tree decomposition of graphs
- Approximating layout problems on random graphs