Secluded connectivity problems

DOI10.1007/978-3-642-40450-4_26MaRDI QIDQ6827564zbMATH OpenFDO

Authors Shiri Chechik, Matthew P. Johnson, M. Parter, David Peleg

Publication date 17 September 2013

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Connectivity (05C40)

This page was built for publication: Secluded connectivity problems

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