Login / Signup

On the bend number of circular-arc graphs as edge intersection graphs of paths on a grid.

Liliana AlcónFlavia BonomoGuillermo DuránMarisa GutierrezMaría Pía MazzoleniBernard RiesMario Valencia-Pabon
Published in: Electron. Notes Discret. Math. (2015)
Keyphrases
  • undirected graph
  • weighted graph
  • circular arcs
  • three dimensional
  • directed graph
  • image segmentation
  • graph structure
  • edge weights