Vertex-disjoint rainbow cycles in edge-colored graphs.
Luyi LiXueliang LiPublished in: Discret. Math. (2022)
Keyphrases
- undirected graph
- edge weights
- weighted graph
- vertex set
- directed graph
- minimum weight
- random graphs
- approximation algorithms
- spanning tree
- attributed graphs
- complex networks
- hamiltonian cycle
- minimum cost
- minimum spanning trees
- graph structure
- directed acyclic graph
- labeled graphs
- average degree
- connected components
- maximum cardinality
- graph theoretic
- connected subgraphs
- strongly connected
- pairwise
- edge detection
- graph theory
- graph matching
- edge information
- graph model
- data objects
- shortest path