Finding a dense-core in jellyfish graphs
From MaRDI portal
Publication:2377899
DOI10.1016/j.comnet.2008.06.005zbMath1152.68340OpenAlexW2152070152MaRDI QIDQ2377899
Udi Weinsberg, Mira Gonen, Avishai Wool, Dana Ron
Publication date: 20 January 2009
Published in: Computer Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.comnet.2008.06.005
Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10)
Related Items (2)
Optimal secret share distribution in degree splitting communication networks ⋮ Finding hidden hubs and dominating sets in sparse graphs by randomized neighborhood queries
This page was built for publication: Finding a dense-core in jellyfish graphs
