Graph designs for the eight-edge five-vertex graphs.
Charles J. ColbournGennian GeAlan C. H. LingPublished in: Discret. Math. (2009)
Keyphrases
- undirected graph
- edge weights
- weighted graph
- vertex set
- directed graph
- labeled graphs
- disjoint paths
- spanning tree
- minimum weight
- graph structure
- adjacency matrix
- directed acyclic graph
- random graphs
- bipartite graph
- strongly connected
- average degree
- complex networks
- connected components
- graph partitioning
- graph structures
- graph construction
- graph clustering
- attributed graphs
- connected subgraphs
- shortest path
- graph theoretic
- approximation algorithms
- graph theory
- minimum spanning tree
- maximum cardinality
- hamiltonian cycle
- planar graphs
- series parallel
- graph representation
- minimum cost
- graph model
- graph kernels
- graph databases
- graph mining
- graph classification
- graph theoretical
- maximum clique
- subgraph isomorphism
- graph matching
- dynamic graph
- edge detection