Local heuristics and the emergence of spanning subgraphs in complex networks

DOI10.1016/J.TCS.2005.12.007MaRDI QIDQ2368968zbMATH OpenOpenAlexFDO

Authors Alexandre Stauffer, Valmir C. Barbosa

Publication date 28 April 2006

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.tcs.2005.12.007

zbMATH Keywords

Complex networksLocal heuristicsSpanning subgraphs

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10)

Recommendations

• Performance Oriented Spanning Trees
• Complex networks and decentralized search algorithms
• Dynamic detection of subgraphs in computer networks
• Dynamics of gossip-like information dissemination in complex computer networks
• Spanners and message distribution in networks.

Cites work

• A critical point for random graphs with a given degree sequence
• Distributed Computing: A Locality-Sensitive Approach
• Generating Low-Degree 2-Spanners
• scientific article; zbMATH DE number 1722964 (Why is no real title available?)
• scientific article; zbMATH DE number 3150484 (Why is no real title available?)
• On the complexity of global computation in the presence of link failures: the general case
• Optimal distributed algorithm for minimum spanning trees revisited
• Paths in graphs
• Relaxing the uniformity and independence assumptions using the concept of fractal dimension
• Statistical mechanics of complex networks

This page was built for publication: Local heuristics and the emergence of spanning subgraphs in complex networks

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