Graphs with no M-alternating paths between two vertices: An update.
Dingjun LouPublished in: Discret. Math. (2010)
Keyphrases
- weighted graph
- labeled graphs
- undirected graph
- random graphs
- attributed graphs
- shortest path
- hamiltonian cycle
- adjacency matrix
- planar graphs
- graph matching
- connected subgraphs
- edge weights
- graph mining
- average degree
- maximal cliques
- graph theoretic
- query graph
- graph model
- graph theory
- maximum cardinality
- directed edges
- bipartite networks
- vertex set
- neural network
- series parallel
- graph databases
- graph structure
- directed graph
- path finding
- optimal path
- graph partitioning
- minimum cost
- densely connected
- relational databases
- connected graphs
- database