Showing cs.DSShow all
2 papers · 1 filter
cs.DS2025
Color-Constrained Arborescences in Edge-Colored Digraphs
P. S. Ardra, Jasine Babu, R. Krithika +1
Given a multigraph whose edges are colored from the set (\emph{-colored graph}), and a vector (\emph{col…
cs.DS2024
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…