On minimum cost edge searching

DOI10.1016/J.TCS.2013.06.009MaRDI QIDQ391138zbMATH OpenOpenAlexFDO

Authors Dariusz Dereniowski, Danny Dyer

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

approximation algorithmgraph searchingminimum costmonotonicitysearch strategy

Mathematics Subject Classification ID

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

Recommendations

• Graph searching and interval completion
• Searching is not jumping.
• On the Fast Searching Problem
• Recontamination does not help to search a graph
• Three-fast-searchable graphs

Cites work

• Graph minors. I. Excluding a forest
• Graph searching and interval completion
• Graph searching, elimination trees, and a generalization of bandwidth
• scientific article; zbMATH DE number 3590298 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• Monotonicity in graph searching
• New Approximation Techniques for Some Linear Ordering Problems
• On search, decision, and the efficiency of polynomial-time algorithms
• Recontamination does not help to search a graph
• Searching and pebbling
• Sweeping graphs with large clique number

Cited in

(3)

• On tradeoffs between width- and fill-like graph parameters
• Graph searching and interval completion
• Searching expenditure and interval graphs

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

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