Improving the Crossing Lemma by Finding More Crossings in Sparse Graphs.

János Pach Rados Radoicic Gábor Tardos Géza Tóth

Published in: Discret. Comput. Geom. (2006)

Keyphrases

high dimensional
weighted graph
graph representation
gaussian graphical models
graph clustering
compressive sensing
sparse data
directed graph
graph theory
bipartite graph
database
graph theoretic
feature space
image sequences
adjacency matrix
series parallel
maximum clique
neural network