default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDInternet Mathematics, Volume 11
Volume 11, Number 1, 2015
- John Augustine, Ning Chen, Edith Elkind, Angelo Fanelli
, Nick Gravin, Dmitry Shiryaev:
Dynamics of Profit-Sharing Games. 1-22 - Shouhuai Xu, Wenlian Lu, Hualun Li:
A Stochastic Model of Active Cyber Defense Dynamics. 23-61 - Maochao Xu, Gaofeng Da, Shouhuai Xu:
Cyber Epidemic Models with Dependences. 62-92
Volume 11, Number 2, 2015
- Yanhua Li, Wei Chen, Yajun Wang, Zhi-Li Zhang:
Voter Model on Signed Social Networks. 93-133 - Shi Li, Gabriel H. Tucci:
Traffic Congestion in Expanders and (p, δ)-Hyperbolic Spaces. 134-142 - Abdelhakim El Maftouhi, Ararat Harutyunyan, Yannis Manoussakis:
Weak Balance in Random Signed Graphs. 143-154 - Pim van der Hoorn, Nelly Litvak:
Degree-Degree Dependencies in Directed Networks with Heavy-Tailed Degrees. 155-179
Volume 11, Number 3, 2015
- Thang N. Dinh, My T. Thai:
Toward Optimal Community Detection: From Trees to General Weighted Networks. 181-200 - Jérôme Kunegis:
Exploiting The Structure of Bipartite Graphs for Algebraic and Spectral Graph Theory Applications. 201-321 - Jeannette C. M. Janssen, Celeste Vautour:
Finding Safe Strategies for Competitive Diffusion on Trees. 232-252 - Samuel D. Johnson, Raissa M. D'Souza:
Inequality and Network Formation Games. 253-276 - Onuttom Narayan, Iraj Saniee, Gabriel H. Tucci:
Lack of Hyperbolicity in Asymptotic Erdös-Renyi Sparse Random Graphs. 277-288 - Erik Thörnblad:
Asymptotic Degree Distribution of a Duplication-Deletion Random Graph Model. 289-305
Volume 11, Numbers 4-5, 2015
Editorials
- Anthony Bonato, Pawel Pralat:
Special Issue on Algorithms and Models for the Web-graph. 307
- Colin Cooper, Alan M. Frieze:
Long Paths in Random Apollonian Networks. 308-318 - Michael Brautbar, Moez Draief, Sanjeev Khanna:
On the Power of Planned Infections in Networks. 319-332 - Fan Chung, Mark Kempton:
A Local Clustering Algorithm for Connection Graphs. 333-351 - David F. Gleich, Kyle Kloster:
Sublinear Column-wise Actions of the Matrix Exponential on Social Networks. 352-384 - Mindaugas Bloznelis, Michal Karonski:
Random Intersection Graph Process. 385-402 - Keshav Goel, Rishi Ranjan Singh, Sudarshan Iyengar, Sukrit Gupta:
A Faster Algorithm to Update Betweenness Centrality After Node Alteration. 403-420 - Bharath Pattabiraman, Md. Mostofa Ali Patwary, Assefaw Hadish Gebremedhin, Wei-keng Liao, Alok N. Choudhary:
Fast Algorithms for the Maximum Clique Problem on Massive Graphs with Applications to Overlapping Community Detection. 421-448 - Fan Chung, Olivia Simpson:
Solving Local Linear Systems with Boundary Conditions Using Heat Kernel Pagerank. 449-471 - Akaki Mamageishvili, Matús Mihalák, Dominik Müller:
Tree Nash Equilibria in the Network Creation Game. 472-486
Volume 11, Number 6, 2015
- Evgeny A. Grechnikov:
The Degree Distribution and the Number of Edges Between Nodes of given Degrees in Directed Scale-Free Graphs. 487-527 - Richard J. La, Maya Kabkab:
A New Random Graph Model with Self-Optimizing Nodes: Connectivity and Diameter. 528-554 - Jonathan W. Berry, Luke A. Fostvedt, Daniel J. Nordman, Cynthia A. Phillips, C. Seshadhri, Alyson G. Wilson:
Why Do Simple Algorithms for Triangle Enumeration Work in the Real World? 555-571 - Xing Shi Cai, Luc Devroye:
The Analysis of Kademlia for Random IDs. 572-587 - Aron Laszka, Assane Gueye:
Network Topology Vulnerability/Cost Trade-Off: Model, Application, and Computational Complexity. 588-626
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-05-09 19:33 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
