The complexity of determining the rainbow vertex-connection of a graph.
Lily ChenXueliang LiYongtang ShiPublished in: Theor. Comput. Sci. (2011)
Keyphrases
- directed graph
- undirected graph
- computational complexity
- labeled graphs
- graph model
- hamiltonian cycle
- minimum weight
- graph matching
- attributed graphs
- polynomial time complexity
- data sets
- vertex set
- strongly connected
- edge weights
- graph representation
- graph partitioning
- spanning tree
- directed acyclic graph
- graph theory
- computational cost
- random graphs
- graph construction
- graph structure
- worst case
- search engine