Fast Searching on Complete k-partite Graphs

COCOA, pp. 159-174, 2016.

Cited by: 3|Views10
EI

Abstract:

Research on graph searching has recently gained interest in computer science, mathematics, and physics. This paper studies fast searching of a fugitive in a graph, a model that was introduced by Dyer, Yang and Yasar in 2008. We provide lower bounds and upper bounds on the fast search number (i.e., the minimum number of searchers required ...More

Code:

Data:

Get fulltext within 24h
Bibtex
Your rating :
0

 

Tags
Comments