On minimum cost edge searching

DOI10.1016/j.tcs.2013.06.009zbMath1295.05228OpenAlexW2125583143MaRDI QIDQ391138

Danny Dyer, Dariusz Dereniowski

Publication date: 10 January 2014

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2013.06.009

zbMATH Keywords

monotonicityapproximation algorithmgraph searchingsearch strategyminimum cost

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25)

Related Items (1)

On tradeoffs between width- and fill-like graph parameters

Cites Work

• Unnamed Item
• Unnamed Item
• Sweeping graphs with large clique number
• Graph minors. I. Excluding a forest
• On search, decision, and the efficiency of polynomial-time algorithms
• Graph searching, elimination trees, and a generalization of bandwidth
• Searching and pebbling
• Graph Searching and Interval Completion
• Monotonicity in graph searching
• New Approximation Techniques for Some Linear Ordering Problems
• Recontamination does not help to search a graph

This page was built for publication: On minimum cost edge searching