Fast-mixed searching on graphs

DOI10.1007/978-3-642-31770-5_29MaRDI QIDQ3167374zbMATH OpenOpenAlexFDO

Authors Boting Yang

Publication date 2 November 2012

Published in Combinatorial Optimization and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-31770-5_29

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Fast-mixed searching and related problems on graphs
• Fast searching games on graphs
• On the Fast Searching Problem
• Fast edge searching and fast searching on graphs
• Fast searching on k-combinable graphs

Cited in

(8)

• Mixed search number and linear-width of interval and split graphs
• Mixed Search Number of Permutation Graphs
• Fast-mixed searching and related problems on graphs
• Efficient lookup on unstructured topologies
• Parameterized and Exact Computation
• Fast searching on k-combinable graphs
• Mixed searching and proper-path-width
• Strong-mixed searching and pathwidth

This page was built for publication: Fast-mixed searching on graphs

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