Path Problems in Networks
From MaRDI portal
Publication:2841524
DOI10.2200/S00245ED1V01Y201001CNT003zbMath1270.68009MaRDI QIDQ2841524
John S. Baras, George Theodorakopoulos
Publication date: 26 July 2013
Published in: Synthesis Lectures on Communication Networks (Search for Journal in Brave)
Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Research exposition (monographs, survey articles) pertaining to computer science (68-02)
Related Items (10)
On the algebraic theory of loop free routing ⋮ Algebraic structures for dynamic networks ⋮ Handling epistemic and aleatory uncertainties in probabilistic circuits ⋮ Algebraic model counting ⋮ Semiring programming: a semantic framework for generalized sum product problems ⋮ Bisimulations for weighted automata over an additively idempotent semiring ⋮ An algebraic framework for multi-objective and robust variants of path problems ⋮ Solving multi-metric network problems: an interplay between idempotent semiring rules ⋮ On the isometric path partition problem ⋮ Optimal decisions in stochastic graphs with uncorrelated and correlated edge weights
This page was built for publication: Path Problems in Networks
