ISSN 1944-9488
Vol. 2, Issue 3, 2005December 31, 2004 EDT
Lower Bounds and Algorithms for Dominating Sets in Web Graphs
Lower Bounds and Algorithms for Dominating Sets in Web Graphs
Articles in Vol. 2, Issue 3, 2005
Vol. 2, Issue 3, 2005
- Towards Scaling Fully Personalized PageRank: Algorithms, Lower Bounds, and ExperimentsKároly CsalogányBalázs RáczTamás SarlósDániel Fogaras
- Lower Bounds and Algorithms for Dominating Sets in Web GraphsRalf KlasingMichele ZitoColin Cooper
- Paradoxical Effects in PageRank Incremental ComputationsSebastiano VignaPaolo BoldiMassimo Santini
- Special Issue on Algorithms and Models for the Web-GraphInternet Mathematics
- Fast PageRank Computation via a Sparse Linear SystemFrancesco RomaniAntonio GullíGianna M. Del Corso
- Modeling the Small-World Phenomenon with Local Network FlowFan ChungReid AndersenLinyuan Lu
- Time-Aware Authority RankingMichalis VazirgiannisKlaus BerberichGerhard Weikum
Klasing, Ralf, Michele Zito, and Colin Cooper. 2005. “Lower Bounds and Algorithms for Dominating Sets in Web Graphs.” Internet Mathematics 2 (3). https://doi.org/10.1080/15427951.2005.10129105.