Destroying Multicolored Paths and Cycles in Edge-Colored Graphs.
Nils Jakob EcksteinNiels GrüttemeierChristian KomusiewiczFrank SommerPublished in: Discret. Math. Theor. Comput. Sci. (2023)
Keyphrases
- disjoint paths
- weighted graph
- undirected graph
- shortest path
- minimum spanning trees
- edge detection
- directed graph
- graph matching
- adjacency graph
- edge weights
- edge detector
- approximation algorithms
- graph construction
- data sets
- spanning tree
- bayesian networks
- edge information
- graph clustering
- graph theoretic
- multiple scales
- graph databases
- graph theory
- structured objects
- edge direction
- mobile robot
- color images
- image processing