Arborescences and Shortest Path Trees when Colors Matter

P. S. Ardra, Jasine Babu, Kritika Kashyap +3

Color-constrained subgraph problems are those where we are given an edge-colored (directed or undirected) graph and the task is to find a specific type of subgraph, like a spanning…