Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Time constrained graph searching

From MaRDI portal
Publication:930887
Jump to:navigation, search

DOI10.1016/j.tcs.2008.02.035zbMath1146.68055OpenAlexW2070526994MaRDI QIDQ930887

Denis Hanson, Brian Alspach, Danny Dyer, Boting Yang

Publication date: 24 June 2008

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2008.02.035


zbMATH Keywords

graphsearching


Mathematics Subject Classification ID

Searching and sorting (68P10) Graph theory (including graph drawing) in computer science (68R10) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)


Related Items (2)

Three-fast-searchable graphs ⋮ The game of cops and eternal robbers



Cites Work

  • Single step graph search problem
  • Fugitive-search games on graphs and related parameters
  • Graph Searching and Interval Completion
  • Handbook of Graph Theory
  • Unnamed Item
  • Unnamed Item
  • Unnamed Item


This page was built for publication: Time constrained graph searching

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:930887&oldid=12898763"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 30 January 2024, at 17:39.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki