Graphs with no M-alternating path between two vertices.
Dingjun LouDongning RaoPublished in: Discret. Math. (2004)
Keyphrases
- weighted graph
- edge weights
- random graphs
- undirected graph
- attributed graphs
- labeled graphs
- adjacency matrix
- shortest path
- hamiltonian cycle
- maximal cliques
- graph matching
- directed graph
- average degree
- directed edges
- connected subgraphs
- graph theoretic
- graph representation
- maximum cardinality
- planar graphs
- strongly connected
- graph model
- graph structure
- vertex set
- phase transition
- graph clustering
- series parallel
- graph structures
- data sets
- endpoints
- graph theory
- search algorithm
- image segmentation