scientific article; zbMATH DE number 7650113
From MaRDI portal
Publication:5875503
DOI10.4230/LIPIcs.APPROX-RANDOM.2019.46MaRDI QIDQ5875503
Publication date: 3 February 2023
Full work available at URL: https://arxiv.org/abs/1809.03589
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Largest random component of a k-cube
- On the upper bound of the size of the \(r\)-cover-free families
- Network tomography: recent developments
- The phase transition in random graphs: A simple proof
- The Volume of the Giant Component of a Random Graph with Given Expected Degrees
- Expander graphs and their applications
- Explicit Non-adaptive Combinatorial Group Testing Schemes
- Network Tomography of Binary Network Performance Characteristics
- The emergence of a giant component in random subgraphs of pseudo-random graphs
- Matching, Euler tours and the Chinese postman
- Graph-Constrained Group Testing
This page was built for publication: