Login / Signup

Edge-intersection graphs of grid paths: The bend-number.

Daniel HeldtKolja B. KnauerTorsten Ueckerdt
Published in: Discret. Appl. Math. (2014)
Keyphrases
  • undirected graph
  • social networks
  • computational complexity
  • fixed number
  • maximum number
  • real time
  • neural network
  • clustering algorithm
  • small number
  • edge detection
  • graph structure
  • random graphs