On the maximum number of edges in topological graphs with no four pairwise crossing edges.
Eyal AckermanPublished in: SCG (2006)
Keyphrases
- maximum number
- pairwise
- directed graph
- spanning tree
- weighted graph
- edge detector
- undirected graph
- edge weights
- edge map
- nodes of a graph
- graph theory
- massive graphs
- d objects
- statistical significance
- real world graphs
- topological features
- graph theoretic
- connected components
- neural network
- edge information
- graph structure
- image restoration