On RAC Drawings of Graphs with one Bend per Edge.
Patrizio AngeliniMichael A. BekosHenry FörsterMichael KaufmannPublished in: CoRR (2018)
Keyphrases
- weighted graph
- undirected graph
- minimum spanning trees
- data sets
- high availability
- oracle database
- graph matching
- graph theoretic
- graph structure
- graph representation
- graph databases
- adjacency graph
- engineering drawings
- edge weights
- spanning tree
- graph model
- directed graph
- graph theory
- line drawings
- multiple scales
- random graphs
- design process
- shortest path
- edge detection