Edge search in graphs and hypergraphs of bounded rank
type: Item
instance of: scholarly article
title: Edge search in graphs and hypergraphs of bounded rank
zbMATH Open document ID: 0772.05090
DOI: 10.1016/0012-365X(93)90473-7
author: Ingo Althöfer
author: Eberhard Triesch
published in: Discrete Mathematics
publication date: 1993-06-20T00:00:00Z
Mathematics Subject Classification ID: 05C99
Mathematics Subject Classification ID: 05C65
Mathematics Subject Classification ID: 68P10
zbMATH DE Number: 205585
zbMATH Keywords: worst-case complexity
zbMATH Keywords: tests
zbMATH Keywords: hypergraphs
MaRDI profile type: Publication
cites work: Q3792452
cites work: Search problems on graphs
cites work: Q3994535
cites work: A search problem on graphs which generalizes some group testing problems with two defectives
cites work: Q4198785
cites work: A Group Testing Problem on Two Disjoint Sets
cites work: Group testing with two defectives
description: scientific article; zbMATH DE number 205585