Login / Signup

On the crossing-free, rectangular embedding of weighted graphs in the plane.

Bernd Becker
Published in: Theoretical Computer Science (1983)
Keyphrases
  • weighted graph
  • shortest path
  • regularization framework
  • discrete data
  • graph structure
  • data objects
  • graph clustering
  • image processing
  • spanning tree
  • edge weights