Control of Some Graph Invariants in Dynamic Routing

DOI10.1007/978-3-540-87477-5_6MaRDI QIDQ3627672zbMATH OpenOpenAlexFDO

Authors Mohamed-Amine Boutiche

Publication date 13 May 2009

Published in Communications in Computer and Information Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-87477-5_6

zbMATH Keywords

graphsroutingtree decompositiontopology controltree widthtree length

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Recommendations

• Dynamic Routing Schemes for General Graphs
• Optimal control of dynamic routing in networks with randomly perturbed flows
• Graph Distances and Controllability of Networks
• Properties of the solutions to the problem of dynamic routing in Networks
• Further results on controllable graphs
• Optimal stopping and control of dynamic routing in networks
• Routing in graphs
• On compact and efficient routing in certain graph classes
• Controllability of undirected graphs
• Dynamic routing schemes for graphs with low local density

Cites work

• Graph minors. II. Algorithmic aspects of tree-width
• On compact and efficient routing in certain graph classes
• Tree-decompositions with bags of small diameter

This page was built for publication: Control of Some Graph Invariants in Dynamic Routing

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