Finding a dense-core in jellyfish graphs

DOI10.1016/J.COMNET.2008.06.005MaRDI QIDQ2377899zbMATH OpenOpenAlexFDO

Authors Mira Gonen, Dana Ron, Udi Weinsberg, Avishai Wool

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

zbMATH Keywords

AS-graphdense-coresublinear algorithm

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Finding a Dense-Core in Jellyfish Graphs
• Finding Dense Subgraphs with Size Bounds
• Fast algorithms for constrained graph density problems
• Dense subgraphs on dynamic networks
• On Finding Dense Subgraphs

Cited in

(5)

• Study of Internet autonomous system interconnectivity from BGP routing tables
• Understanding edge connectivity in the Internet through core decomposition
• Finding hidden hubs and dominating sets in sparse graphs by randomized neighborhood queries
• Finding a Dense-Core in Jellyfish Graphs
• Optimal secret share distribution in degree splitting communication networks

This page was built for publication: Finding a dense-core in jellyfish graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2377899)