On topological graphs with at most four crossings per edge.
Eyal AckermanPublished in: Comput. Geom. (2019)
Keyphrases
- weighted graph
- undirected graph
- reeb graph
- minimum spanning trees
- edge detection
- graph theoretic
- connected components
- topological information
- topological properties
- graph mining
- series parallel
- adjacency graph
- graph matching
- graph databases
- edge weights
- neural network
- graph model
- spanning tree
- graph partitioning
- image processing
- graph structure
- labeled graphs
- topological features
- complex structures
- strongly connected
- data sets
- graph clustering
- graph representation
- graph theory
- edge detector
- directed graph
- shortest path