The fast search number of a complete \(k\)-partite graph

DOI10.1007/s00453-018-0456-zzbMath1397.05193OpenAlexW2804416848WikidataQ129788795 ScholiaQ129788795MaRDI QIDQ1799234

Boting Yang, Sandra Zilles, Farong Zhong, Yuan Xue

Publication date: 18 October 2018

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00453-018-0456-z

zbMATH Keywords

bipartite graphsplit graphcomplete \(k\)-partite graphfast searching

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) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (3)

Fast searching on \(k\)-combinable graphs ⋮ Edge searching and fast searching with constraints ⋮ Fast searching on cactus graphs

Cites Work

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

This page was built for publication: The fast search number of a complete \(k\)-partite graph