Fast Searching on Complete k-partite Graphs

DOI10.1007/978-3-319-48749-6_12zbMath1483.68359OpenAlexW2544933647MaRDI QIDQ2958311

Farong Zhong, Sandra Zilles, Yuan Xue, Boting Yang

Publication date: 1 February 2017

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

Full work available at URL: https://doi.org/10.1007/978-3-319-48749-6_12

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (2)

The fast search number of a Cartesian product of graphs ⋮ The fast search number of a complete \(k\)-partite graph

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Fast searching games on graphs
• Fast edge searching and fast searching on graphs
• An annotated bibliography on guaranteed graph searching
• Three-fast-searchable graphs
• Fast Searching on Cartesian Products of Graphs
• On the Fast Searching Problem
• Lower Bounds on Edge Searching
• Topological Bandwidth
• The complexity of searching a graph

This page was built for publication: Fast Searching on Complete k-partite Graphs