Pages that link to "Item:Q2490261"
From MaRDI portal
The following pages link to On certain connectivity properties of the internet topology (Q2490261):
Displaying 18 items.
- Approximability of the vertex cover problem in power-law graphs (Q385960) (← links)
- Rumor spreading in social networks (Q541666) (← links)
- The cover time of the preferential attachment graph (Q864904) (← links)
- Parallelism in simulation and modeling of scale-free complex networks (Q991146) (← links)
- Message survival and decision dynamics in a class of reactive complex systems subject to external fields (Q1782825) (← links)
- Large deviations for the degree structure in preferential attachment schemes (Q1948702) (← links)
- Fault tolerant mechanism design (Q2389683) (← links)
- How much can taxes help selfish routing? (Q2495395) (← links)
- (Q2857363) (← links)
- The Small Community Phenomenon in Networks: Models, Algorithms and Applications (Q2898016) (← links)
- First-passage percolation on a ladder graph, and the path cost in a VCG auction (Q2998892) (← links)
- Braess's paradox in expanders (Q3145837) (← links)
- Giant descendant trees, matchings, and independent sets in age-biased attachment graphs (Q5086992) (← links)
- A Geometric Preferential Attachment Model of Networks II (Q5458299) (← links)
- (Q5743505) (← links)
- A Theory of Network Security: Principles of Natural Selection and Combinatorics (Q5856435) (← links)
- Multiple random walks on graphs: mixing few to cover many (Q6085870) (← links)
- Locality of random digraphs on expanders (Q6116322) (← links)
