Reporting the crossing-free segments of a complete geometric graph.
Masahiko FurukataKouhei AsanoPublished in: Int. J. Comput. Math. (1996)
Keyphrases
- graph theoretical
- topological information
- data analysis
- directed graph
- random walk
- bipartite graph
- graph theory
- weighted graph
- geometric structure
- graph representation
- structured data
- connected components
- dependency graph
- graph matching
- graph partitioning
- neural network
- graph search
- random graphs
- graph clustering
- graph theoretic
- web graph
- graph model
- graph mining
- directed acyclic graph
- link analysis
- graph structure
- ranking algorithm
- business intelligence
- line segments