On RAC drawings of graphs with one bend per edge.
Patrizio AngeliniMichael A. BekosHenry FörsterMichael KaufmannPublished in: Theor. Comput. Sci. (2020)
Keyphrases
- weighted graph
- undirected graph
- edge detection
- graph theoretic
- graph matching
- line drawings
- minimum spanning trees
- graph partitioning
- graph theory
- edge information
- oracle database
- spanning tree
- directed graph
- vertex set
- adjacency graph
- graph mining
- edge detector
- graph clustering
- series parallel
- graph structure
- graph databases
- multiple scales
- engineering drawings
- database