The Complexity of Restricted Variants of the Stable Paths Problem
From MaRDI portal
Publication:3000275
DOI10.3233/FI-2010-319zbMath1214.68062OpenAlexW1761408157MaRDI QIDQ3000275
Kevin P. Donnelly, Andrei Lapets, A. J. Kfoury
Publication date: 18 May 2011
Published in: Fundamenta Informaticae (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3233/fi-2010-319
Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Network protocols (68M12) Internet topics (68M11)
This page was built for publication: The Complexity of Restricted Variants of the Stable Paths Problem
