Simplifying Urban Network Security Games with Cut-Based Graph Contraction.
Hiroaki IwashitaKotaro OhoriHirokazu AnaiAtsushi IwasakiPublished in: AAMAS (2016)
Keyphrases
- graphical representation
- transport network
- fully connected
- spanning tree
- sparsely connected
- graph representation
- complex networks
- edge weights
- minimum cut
- multicommodity flow
- computer networks
- communication networks
- network traffic
- weighted graph
- network structure
- transportation networks
- planar graphs
- peer to peer
- scale free
- normalized cut
- wireless sensor networks
- directed acyclic graph
- network model
- overlapping communities
- image segmentation
- public transport
- dynamic networks
- small world
- graph cuts
- graph structure