Login / Signup
All-Pairs 2-Reachability in O(n^w log n) Time.
Loukas Georgiadis
Daniel Graf
Giuseppe F. Italiano
Nikos Parotsidis
Przemyslaw Uznanski
Published in:
ICALP (2017)
Keyphrases
</>
worst case
lower bound
pairwise
state space
upper bound
genetic algorithm
artificial intelligence
computer vision
multiresolution
np hard