Improving the crossing lemma by finding more crossings in sparse graphs: [extended abstract].
János PachRados RadoicicGábor TardosGéza TóthPublished in: SCG (2004)
Keyphrases
- extended abstract
- gaussian graphical models
- maximum clique
- graph matching
- graph theoretic
- sparse data
- graph mining
- johnson lindenstrauss
- real time
- maximal cliques
- random graphs
- compressive sensing
- graph representation
- graph model
- weighted graph
- graph theory
- directed graph
- graphical models
- probabilistic model
- np hard
- neural network