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

A ternary search problem on two disjoint sets

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

DOI10.1016/j.dam.2018.05.026zbMath1401.05289OpenAlexW2807652950WikidataQ129729016 ScholiaQ129729016MaRDI QIDQ1627863

Eberhard Triesch, Xiao-Hui Wu, Sheng-Jia Li

Publication date: 3 December 2018

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

Full work available at URL: https://doi.org/10.1016/j.dam.2018.05.026


zbMATH Keywords

search theorycomplete bipartite graphsgroup tests


Mathematics Subject Classification ID

Searching and sorting (68P10) Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (05C99)




Cites Work

  • Unnamed Item
  • Unnamed Item
  • Search problems on graphs


This page was built for publication: A ternary search problem on two disjoint sets

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