On the 3-restricted edge connectivity of permutation graphs.
Camino BalbuenaDiego González-MorenoXavier MarcotePublished in: Discret. Appl. Math. (2009)
Keyphrases
- weighted graph
- strongly connected
- undirected graph
- graph connectivity
- edge detection
- connected components
- graph matching
- vertex set
- edge information
- graph theory
- edge detector
- graph partitioning
- graph representation
- graph theoretic
- edge weights
- graph clustering
- topological information
- adjacency matrix
- graph kernels
- random graphs
- minimum spanning trees
- graph databases
- object recognition
- data sets
- connected graphs
- subgraph isomorphism
- topological properties
- multiple scales
- graph structure
- bayesian networks