Login / Signup
Network Sparsification for Steiner Problems on Planar and Bounded-Genus Graphs.
Marcin Pilipczuk
Michal Pilipczuk
Piotr Sankowski
Erik Jan van Leeuwen
Published in:
FOCS (2014)
Keyphrases
</>
dynamic networks
reinforcement learning
np complete
network structure
spanning tree
peer to peer
complex networks
communication networks
graph matching
link prediction
graph mining
transportation networks
fully connected
planar graphs
finding the shortest path