A characterisation of graphs having three pairwise compatible Euler tours.
Bill JacksonPublished in: J. Comb. Theory, Ser. B (1991)
Keyphrases
- pairwise
- graph matching
- multi class
- high order
- higher order
- directed graph
- similarity measure
- image segmentation
- pairwise similarities
- graph partitioning
- graph model
- graph mining
- differential equations
- traveling salesman problem
- point sets
- markov random field
- semi supervised
- similarity function
- graph theory
- weighted graph
- statistical significance
- knn
- graph theoretic
- similarity matrix
- graph construction
- vehicle routing
- neural network