Fast-mixed searching and related problems on graphs
type: Item
instance of: scholarly article
title: Fast-mixed searching and related problems on graphs
zbMATH Open document ID: 1302.05197
author: Boting Yang
published in: Theoretical Computer Science
publication date: 2014-01-16T00:00:00Z
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 68R10
zbMATH DE Number: 6246002
MaRDI profile type: Publication
full work available at URL: j.tcs.2013.04.015
OpenAlex ID: W1991356098
cites work: Monotonicity in graph searching
cites work: On the Fast Searching Problem
cites work: Interval graphs and interval orders
cites work: Lex-BFS and partition refinement, with applications to transitive orientation, interval graph recognition and consecutive ones testing
cites work: Q5387696
cites work: Searching and pebbling
cites work: Recontamination does not help to search a graph
cites work: Splitting a graph into disjoint induced paths or cycles.
cites work: The complexity of searching a graph
cites work: Optimal covering of cacti by vertex-disjoint paths
cites work: Induced-path partition on graphs with special blocks
cites work: Minimum-weight triangulation is NP-hard
cites work: Fast searching games on graphs
cites work: Q4869540
cites work: Fast edge searching and fast searching on graphs
DOI: 10.1016/J.TCS.2013.04.015
Recommended article: Fast-Mixed Searching on Graphs
Recommended article: Fast searching on \(k\)-combinable graphs
Recommended article: Fast edge searching and fast searching on graphs
Recommended article: Fast Edge-Searching and Related Problems
Recommended article: Fast Searching on Complete k-partite Graphs
Recommended article: Fast parallel graph searching with applications
Recommended article: Fast Searching on Cartesian Products of Graphs
Recommended article: Fast searching on cactus graphs
Recommended article: Search problems on graphs
Recommended article: On the Fast Searching Problem
description: scientific article; zbMATH DE number 6246002