Binary search in graphs revisited
type: Item
instance of: scholarly article
title: Binary search in graphs revisited
zbMATH Open document ID: 1422.68058
author: Argyrios Deligkas
author: George B. Mertzios
author: P. G. Spirakis
published in: Algorithmica
publication date: 2019-05-07T00:00:00Z
Mathematics Subject Classification ID: 68P10
Mathematics Subject Classification ID: 68R10
zbMATH DE Number: 7051762
zbMATH Keywords: binary search
zbMATH Keywords: graph
zbMATH Keywords: approximate query
zbMATH Keywords: probabilistic algorithm
zbMATH Keywords: lower bound
MaRDI profile type: Publication
full work available at URL: s00453-018-0501-y
OpenAlex ID: W2594084810
cites work: Optimal Search in Trees
cites work: Searching a Tree with Permanently Noisy Advice
cites work: Searching in random partially ordered sets
cites work: On the complexity of searching in trees and partially ordered structures
cites work: The binary identification problem for weighted trees
cites work: Edge ranking and searching in partial orders
cites work: Q5111415
cites work: Q4857782
cites work: Q4607906
cites work: Deterministic and probabilistic binary search in graphs
cites work: Computing with Noisy Information
cites work: Optimal node ranking of trees
cites work: On binary searching with non-uniform costs
cites work: Edge ranking of graphs is hard
cites work: Optimal edge ranking of trees in linear time
cites work: Searching ordered structures
cites work: Q3579429
cites work: Searching games with errors -- fifty years of coping with liars
cites work: Q5331663
cites work: Optimal node ranking of tree in linear time
cites work: Q4121861
DOI: 10.1007/S00453-018-0501-Y
description: scientific article; zbMATH DE number 7051762