Login / Signup
Proof of the Loebl-Komlós-Sós conjecture for large, dense graphs.
Oliver Cooley
Published in:
Discret. Math. (2009)
Keyphrases
</>
complex structures
series parallel
graph theoretic
graph representation
graph partitioning
theorem proving
spanning tree
quasi cliques
graph structures
graph structure
graph matching
directed graph
neural network
real time
weighted graph
graph theory
optical flow fields
data sets