Graph Minors. XIX. Well-quasi-ordering on a surface.
Neil RobertsonPaul D. SeymourPublished in: J. Comb. Theory, Ser. B (2004)
Keyphrases
- graph theory
- graph representation
- directed graph
- random walk
- structured data
- three dimensional
- graph model
- d objects
- graph databases
- surface reconstruction
- graph search
- directed acyclic graph
- graph clustering
- graph structure
- graph structures
- normal vectors
- surface features
- graph data
- graph theoretic
- bipartite graph
- graph matching
- connected components
- knn