Crossref Citations
This Book has been
cited by the following publications. This list is generated based on data provided by Crossref.
Bonnet, Édouard
Duron, Julien
Sylvester, John
Zamaraev, Viktor
and
Zhukovskii, Maksim
2024.
Small but Unwieldy: A Lower Bound on Adjacency Labels for Small Classes.
SIAM Journal on Computing,
Vol. 53,
Issue. 5,
p.
1578.
Glukhov, O.D.
2024.
On the Connectivity of Quasi-random Graphs.
Èlektronnoe modelirovanie,
Vol. 46,
Issue. 6,
p.
3.
Komjáthy, Júlia
Lapinskas, John
Lengler, Johannes
and
Schaller, Ulysse
2024.
Polynomial growth in degree-dependent first passage percolation on spatial random graphs.
Electronic Journal of Probability,
Vol. 29,
Issue. none,
Chen, Tianyi
and
Tsourakakis, Charalampos E.
2024.
Parallel Motif-Based Community Detection.
p.
509.
Casse, Jérôme
2025.
Siblings in d-dimensional nearest neighbour trees.
Bernoulli,
Vol. 31,
Issue. 2,
Işlak, Ümit
and
İncekara, Buğra
2025.
Clique structure and other network properties of the tensor product of Erdős–Rényi graphs.
Brazilian Journal of Probability and Statistics,
Vol. 39,
Issue. 2,
Gorbachov, Valeriy
and
Fedorov, Vitalii
2025.
ANALYSIS OF MATHEMATICAL MODELS OF RANDOM GRAPHS.
Системи управління, навігації та зв’язку. Збірник наукових праць,
Vol. 3,
Issue. 81,
p.
59.
Versteegen, Leo
2025.
Upper Bounds for Linear Graph Codes.
Random Structures & Algorithms,
Vol. 66,
Issue. 1,