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

Minimal trees of a given search number

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

DOI10.1007/BF01124984zbMath0875.68317MaRDI QIDQ1816287

Petr A. Golovach

Publication date: 14 January 1997

Published in: Cybernetics and Systems Analysis (Search for Journal in Brave)


zbMATH Keywords

minimal treessearching graph


Mathematics Subject Classification ID

Searching and sorting (68P10) Graph theory (including graph drawing) in computer science (68R10)


Related Items (1)

The realizability problem for Golovach-type functions



Cites Work

  • Unnamed Item
  • Minimal trees of given search number
  • The complexity of searching a graph




This page was built for publication: Minimal trees of a given search number

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