Graph searching with advice
type: Item
instance of: scholarly article
title: Graph searching with advice
zbMATH Open document ID: 1163.68015
author: Nicolas Nisse
author: David Soguet
published in: Theoretical Computer Science
publication date: 2009-03-30T00:00:00Z
Mathematics Subject Classification ID: 68P10
Mathematics Subject Classification ID: 68M12
Mathematics Subject Classification ID: 68M14
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 68R10
zbMATH DE Number: 5534952
zbMATH Keywords: graph searching
zbMATH Keywords: monotonicity
zbMATH Keywords: bits of advice
MaRDI profile type: Publication
full work available at URL: j.tcs.2008.08.020
OpenAlex ID: W2174013141
cites work: Graph-Theoretic Concepts in Computer Science
cites work: The power of a pebble: Exploring and mapping directed graphs
cites work: Q4035355
cites work: Monotonicity in graph searching
cites work: Distributed Chasing of Network Intruders
cites work: Selective families, superimposed codes, and broadcasting on unknown radio networks. (Extended abstract)
cites work: Compact and localized distributed data structures
cites work: Hundreds of impossibility results for distributed computing
cites work: Distributed Computing with Advice: Information Sensitivity of Graph Coloring
cites work: Oracle size
cites work: Tree Exploration with an Oracle
cites work: Connected Treewidth and Connected Graph Searching
cites work: Recontamination does not help to search a graph
cites work: The complexity of searching a graph
cites work: Q4159394
cites work: Graph searching and a min-max theorem for tree-width
cites work: Algorithms and Computation
DOI: 10.1016/J.TCS.2008.08.020
description: scientific article; zbMATH DE number 5534952