Efficient algorithms for game-theoretic betweenness centrality
- 1 February 2016
- journal article
- research article
- Published by Elsevier in Artificial Intelligence
- Vol. 231, 39-63
Abstract
No abstract availableKeywords
Funding Information
- Polish National Science Centre (DEC-2013/09/N/ST6/04095)
- European Research Council (291528)
- Foundation For Polish Science (Homing Plus/2013-7/4)
- Regional Development Fund
This publication has 37 references indexed in Scilit:
- Routing betweenness centralityJournal of the ACM, 2010
- Effort Games and the Price of MyopiaMathematical Logic Quarterly, 2009
- Power in threshold network flow gamesAutonomous Agents and Multi-Agent Systems, 2008
- PDZBase: a protein–protein interaction database for PDZ-domainsBioinformatics, 2004
- Attack vulnerability of complex networksPhysical Review E, 2002
- A faster algorithm for betweenness centrality*The Journal of Mathematical Sociology, 2001
- Error and attack tolerance of complex networksNature, 2000
- The anatomy of a large-scale hypertextual Web search engineComputer Networks and ISDN Systems, 1998
- Theoretical Foundations for Centrality MeasuresAmerican Journal of Sociology, 1991
- Monotonic solutions of cooperative gamesInternational Journal of Game Theory, 1985