Titel

Merkliste
1 Ergebnisse

Covert Networks : How Hard is It to Hide?:

, In: Proceedings of the 18th International Conference on Autonomous Agents and MultiAgent Systems,

Dey, Palash ; Medya, Sourav - p. 628-637 , 2019

Link: https://dl.acm.org/doi/10.5555/3306127.3331749

RT 
T1 <cTitle>Proceedings of the 18th International Conference on Autonomous Agents and MultiAgent Systems</cTitle>: T1 <Title>Covert Networks				: How Hard is It to Hide?</Title>

UL https://suche.suub.uni-bremen.de/peid=acm-3331749&Exemplar=1&LAN=DE
				
A1 Dey, Palash
A1 Medya, Sourav
PB International Foundation for Autonomous Agents and Multiagent Systems
YR 2019
K1 algorithms
K1 approximation algorithm
K1 centrality
K1 core
K1 covert network
K1 densest subgraph
K1 hiding in networks
K1 network design
K1 social influence
K1 social network analysis
K1 Information systems
K1 World Wide Web
K1 Web applications
K1 Social networks
K1 Security and privacy
K1 Software and application security
K1 Social network security and privacy
K1 Human-centered computing
K1 Collaborative and social computing
K1 Collaborative and social computing design and evaluation methods
K1 Social network analysis
K1 Theory of computation
K1 Theory and algorithms for application domains
K1 Algorithmic game theory and mechanism design
K1 Design and analysis of algorithms
K1 Streaming, sublinear and near linear time algorithms
K1 Algorithmic game theory
SP 628
OP 637
LK http://dx.doi.org/https://dl.acm.org/doi/10.5555/3306127.3331749
DO https://dl.acm.org/doi/10.5555/3306127.3331749
SF ELIB - SuUB Bremen

Export

RefWorks (nur Desktop-Version!)
Flow (Zuerst in Flow einloggen, dann importieren)