On 3D visibility representations of graphs with few crossings per edge.
Patrizio AngeliniMichael A. BekosMichael KaufmannFabrizio MontecchianiPublished in: Theor. Comput. Sci. (2019)
Keyphrases
- weighted graph
- graph representations
- undirected graph
- edge detection
- graph theoretic
- adjacency graph
- minimum spanning trees
- graph theory
- edge information
- edge detector
- graph partitioning
- graph matching
- graph representation
- multiple representations
- compression artifacts
- series parallel
- subgraph isomorphism
- data representations
- multiple scales
- edge map
- graph databases
- directed graph
- shortest path