Partitioning 2-edge-colored graphs by monochromatic paths and cycles.
József BaloghJános BarátDániel GerbnerAndrás GyárfásGábor N. SárközyPublished in: Comb. (2014)
Keyphrases
- weighted graph
- disjoint paths
- graph partitioning
- vertex set
- undirected graph
- shortest path
- directed graph
- spectral graph
- graph model
- edge information
- minimum spanning trees
- graph theory
- partitioning algorithm
- edge weights
- graph theoretic
- edge detector
- graph matching
- pairwise
- graph structure
- graph mining
- path finding
- edge detection
- series parallel
- adjacency graph
- image segmentation
- subgraph isomorphism
- graph construction
- random graphs
- small world
- graph representation
- minimum cost