Login / Signup
The Complexity of Computing the Cylindrical and the t-Circle Crossing Number of a Graph.
Frank Duque
Hernán González-Aguilar
César Hernández-Vélez
Jesús Leaños
Carolina Medina
Published in:
Electron. J. Comb. (2018)
Keyphrases
</>
computational complexity
polynomial time complexity
case study
computational cost
small number
worst case
graph structure
fixed number
database
k means
random walk
decision problems
maximum number
graph representation