Characterizing forbidden pairs for rainbow connection in graphs with minimum degree 2.
Premysl HolubZdenek RyjácekIngo SchiermeyerPetr VránaPublished in: Discret. Math. (2016)
Keyphrases
- spanning tree
- pairwise
- minimum cost
- random graphs
- graph structure
- graph mining
- optimal solution
- graph matching
- small world
- connected dominating set
- data sets
- preferential attachment
- degree distribution
- series parallel
- power law
- graph representation
- graph theory
- directed graph
- random walk
- image segmentation
- neural network