The fast search number of a complete \(k\)-partite graph
type: Item
instance of: scholarly article
title: The fast search number of a complete \(k\)-partite graph
zbMATH Open document ID: 1397.05193
author: Yuan Xue
author: Boting Yang
author: Farong Zhong
author: Sandra Zilles
published in: Algorithmica
publication date: 2018-10-18T00:00:00Z
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 68T20
Mathematics Subject Classification ID: 68R10
zbMATH DE Number: 6958257
zbMATH Keywords: fast searching
zbMATH Keywords: complete \(k\)-partite graph
zbMATH Keywords: bipartite graph
zbMATH Keywords: split graph
MaRDI profile type: Publication
full work available at URL: s00453-018-0456-z
OpenAlex ID: W2804416848
cites work: Q3418339
cites work: Lower Bounds on Edge Searching
cites work: Q4035355
cites work: Q3090934
cites work: Three-fast-searchable graphs
cites work: On the Fast Searching Problem
cites work: An annotated bibliography on guaranteed graph searching
cites work: Q5445040
cites work: Topological Bandwidth
cites work: The complexity of searching a graph
cites work: Fast searching games on graphs
cites work: The fast search number of a Cartesian product of graphs
cites work: Fast Searching on Complete k-partite Graphs
cites work: Fast edge searching and fast searching on graphs
Wikidata QID: Q129788795
DOI: 10.1007/S00453-018-0456-Z
description: scientific article; zbMATH DE number 6958257