Secluded Path via Shortest Path

DOI10.1007/978-3-319-09620-9_10zbMath1416.68137OpenAlexW94543140MaRDI QIDQ5496152

Matthew P. Johnson, Ou Liu, George Rabanca

Publication date: 7 August 2014

Published in: Structural Information and Communication Complexity (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-09620-9_10

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) Approximation algorithms (68W25)

Related Items (4)

Parameterized complexity of secluded connectivity problems ⋮ Secluded connectivity problems ⋮ Finding connected secluded subgraphs ⋮ Unnamed Item

This page was built for publication: Secluded Path via Shortest Path