Login / Signup
Genus characterizes the complexity of certain graph problems: Some tight results.
Jianer Chen
Iyad A. Kanj
Ljubomir Perkovic
Eric Sedgwick
Ge Xia
Published in:
J. Comput. Syst. Sci. (2007)
Keyphrases
</>
problems involving
graph representation
worst case
decision problems
structured data
np complete
polynomial time complexity
bipartite graph
optimization problems
upper bound
computational complexity
computational cost
connected components
evolutionary algorithm
lower bound
causal graph
reinforcement learning