Destroying Multicolored Paths and Cycles in Edge-Colored Graphs.
Nils Jakob EcksteinNiels GrüttemeierChristian KomusiewiczFrank SommerPublished in: CoRR (2021)
Keyphrases
- weighted graph
- disjoint paths
- undirected graph
- shortest path
- graph matching
- edge detection
- edge weights
- graph theory
- directed graph
- minimum spanning trees
- adjacency graph
- edge information
- graph structure
- structured objects
- edge detector
- directed acyclic graph
- structured data
- graph partitioning
- subgraph isomorphism
- bipartite graph
- approximation algorithms