Login / Signup
On the Hardness of Partially Dynamic Graph Problems and Connections to Diameter.
Søren Dahlgaard
Published in:
ICALP (2016)
Keyphrases
</>
np complete
np hard
social networks
optimal solution
computational complexity