2019
DOI: 10.1016/j.dam.2019.02.031
|View full text |Cite
|
Sign up to set email alerts
|

Some optimal combinatorial batch codes with k=5

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2021
2021
2023
2023

Publication Types

Select...
2
1

Relationship

0
3

Authors

Journals

citations
Cited by 3 publications
(1 citation statement)
references
References 8 publications
0
1
0
Order By: Relevance
“…A number of works focused on solving CBC for specific cases, e.g. when k is small (k = 3, 4, 5) or when n = m + 2 [7]. In almost all cases, the main used method is Hall's theorem from graph theory.…”
Section: Introductionmentioning
confidence: 99%
“…A number of works focused on solving CBC for specific cases, e.g. when k is small (k = 3, 4, 5) or when n = m + 2 [7]. In almost all cases, the main used method is Hall's theorem from graph theory.…”
Section: Introductionmentioning
confidence: 99%