Login / Signup
Genus Characterizes the Complexity of Graph Problems: Some Tight Results.
Jianer Chen
Iyad A. Kanj
Ljubomir Perkovic
Eric Sedgwick
Ge Xia
Published in:
ICALP (2003)
Keyphrases
</>
decision problems
worst case
problems involving
np hardness
data sets
computational complexity
evolutionary algorithm
multi objective
optimization problems
complex networks
space complexity
polynomial time complexity