Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

scientific article

From MaRDI portal
Publication:2921652
Jump to:navigation, search

zbMath1297.68258MaRDI QIDQ2921652

No author found.

Publication date: 13 October 2014


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


Mathematics Subject Classification ID

Games involving graphs (91A43) General equilibrium theory (91B50) Approximation algorithms (68W25)


Related Items (10)

A derandomized approximation algorithm for the critical node detection problem ⋮ A randomized algorithm with local search for containment of pandemic disease spread ⋮ A Region Growing Algorithm for Detecting Critical Nodes ⋮ A Fast Greedy Algorithm for the Critical Node Detection Problem ⋮ Finding the probability of infection in an SIR network is NP-hard ⋮ The bi-objective critical node detection problem ⋮ Competitive and collaborative influence in social networks ⋮ A network game with attackers and a defender ⋮ The Complexity and Approximability of Minimum Contamination Problems ⋮ The critical node detection problem in networks: a survey




This page was built for publication:

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:2921652&oldid=15893185"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 3 February 2024, at 21:13.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki