(2, 1)-coloring of edge-multiplicity-paths-replacement graph.
Nibedita MandalPratima PanigrahiPublished in: Discuss. Math. Graph Theory (2018)
Keyphrases
- disjoint paths
- weighted graph
- undirected graph
- shortest path
- edge weights
- directed graph
- edge detection
- graph model
- graph theory
- graph clustering
- structured data
- approximation algorithms
- bipartite graph
- graph structure
- random walk
- graph theoretic
- path length
- stable set
- edge information
- edge detector
- connected components
- strongly connected
- objective function
- contour closure
- path finding
- graph representation
- graph partitioning
- spanning tree
- directed acyclic graph
- semi supervised