scientific article; zbMATH DE number 2019639

zbMath1028.68569MaRDI QIDQ4440442

Milena Mihail, Christos H. Papadimitriou

Publication date: 17 December 2003

Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2483/24830254.htm

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Graph theory (including graph drawing) in computer science (68R10) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Information storage and retrieval of data (68P20) Randomized algorithms (68W20)

Related Items (9)

Ranking hubs and authorities using matrix functions ⋮ Portfolio Construction by Mitigating Error Amplification: The Bounded-Noise Portfolio ⋮ A Geometric Preferential Attachment Model of Networks II ⋮ Optimization via low-rank approximation for community detection in networks ⋮ Improvements on SCORE, Especially for Weak Signals ⋮ Some Properties of Random Apollonian Networks ⋮ A spectral method for community detection in moderately sparse degree-corrected stochastic block models ⋮ Why Do Simple Algorithms for Triangle Enumeration Work in the Real World? ⋮ On the Limiting Behavior of Parameter-Dependent Network Centrality Measures

This page was built for publication: