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

A binary search problem on graphs

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

DOI10.1016/0166-218X(92)90207-QzbMath0768.68139OpenAlexW2094235894MaRDI QIDQ1186168

Reinhard Franzkeit

Publication date: 28 June 1992

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0166-218x(92)90207-q


zbMATH Keywords

bipartite graphbinary search


Mathematics Subject Classification ID

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





Cites Work

  • Search problems on graphs
  • A ternary search problem on graphs
  • Group testing with two defectives
  • A search problem on graphs which generalizes some group testing problems with two defectives
  • A Group Testing Problem
  • A Group Testing Problem on Two Disjoint Sets
  • Unnamed Item




This page was built for publication: A binary search problem on graphs

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1186168&oldid=12053062"
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 00:13.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki