An Improved Bound for Vertex Partitions by Connected Monochromatic K-Regular Graphs.
Gábor N. SárközyStanley M. SelkowFei SongPublished in: J. Graph Theory (2013)
Keyphrases
- vertex set
- undirected graph
- directed graph
- labeled graphs
- hamiltonian cycle
- attributed graphs
- lower bound
- upper bound
- connected components
- neighborhood graph
- average degree
- worst case
- graph theoretic
- weighted graph
- graph matching
- graph structures
- connected subgraphs
- connected graphs
- complex structures
- graph clustering
- edge weights
- graph mining
- graph structure
- error bounds
- clustering algorithm
- random graphs
- graph kernels
- neural network
- directed acyclic graph
- social network analysis