Finding paths with minimum shared edges

DOI10.1007/978-3-642-22685-4_49zbMATH Open1353.68217OpenAlexW2784293985WikidataQ62037445 ScholiaQ62037445MaRDI QIDQ3087983FDOQ3087983

Authors: Masoud T. Omran, Jörg-Rüdiger Sack, Hamid Zarrabi-Zadeh 

Publication date: 17 August 2011

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

Full work available at URL: https://doi.org/10.1007/978-3-642-22685-4_49

Recommendations

• Finding paths with minimum shared edges
• The minimum vulnerability problem
• The minimum vulnerability problem
• The minimum vulnerability problem on graphs
• The minimum vulnerability problem on specific graph classes

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59) Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25) Paths and cycles (05C38)

Cited In (12)

• The minimum vulnerability problem on graphs
• The parameterized complexity of the minimum shared edges problem
• Safety in \(s\)-\(t\) paths, trails and walks
• The parameterized complexity of the minimum shared edges problem
• Finding the Minimum-Weight k-Path
• Constructing disjoint paths for secure communication
• Finding paths with minimum shared edges
• The minimum vulnerability problem
• The minimum vulnerability problem
• Secluded path via shortest path
• The minimum shared edges problem on grid-like graphs
• Secluded connectivity problems

This page was built for publication: Finding paths with minimum shared edges

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