Mathematical Research Data Initiative
Main page
Recent changes
Random page
SPARQL
MaRDI@GitHub
New item
In other projects
MaRDI portal item
Discussion
View source
View history
English
Log in

Non-adaptive group testing on graphs with connectivity

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

DOI10.1007/S10878-019-00379-0zbMATH Open1425.90098OpenAlexW2910986390WikidataQ128577332 ScholiaQ128577332MaRDI QIDQ2424809FDOQ2424809

Song Luo, Yuji Matsuura, Ying Miao, Maiko Shigeno

Publication date: 25 June 2019

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-019-00379-0



zbMATH Keywords

group testingcomplete graphnon-adaptive schemetorus grid graph


Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Combinatorial optimization (90C27)


Cites Work

  • Title not available (Why is that?)
  • Title not available (Why is that?)
  • Nonrandom binary superimposed codes
  • Graph-Constrained Group Testing


Cited In (1)

  • Nonadaptive Group Testing Based on Sparse Pooling Graphs






This page was built for publication: Non-adaptive group testing on graphs with connectivity

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2424809)

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:2424809&oldid=15077410"
Tools
What links here
Related changes
Printable version
Permanent link
Page information
This page was last edited on 2 February 2024, at 20:59. Warning: Page may not contain recent updates.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki