Making a Graph Crossing-Critical by Multiplying its Edges.
Laurent BeaudouCésar Hernández-VélezGelasio SalazarPublished in: Electron. J. Comb. (2013)
Keyphrases
- directed graph
- weighted graph
- undirected graph
- spanning tree
- directed acyclic graph
- edge weights
- graph model
- connected components
- nodes of a graph
- random walk
- real world graphs
- spectral embedding
- graph theory
- massive graphs
- graph partitioning
- graph structure
- maximum matching
- vertex set
- edge detector
- graph theoretic
- stable set
- data sets
- bipartite graph
- approximation algorithms
- adjacency matrix
- edge information
- graph search
- graph representation
- edge map
- graph databases
- graph mining
- graph matching
- pattern mining
- structured data
- search algorithm