Showing cs.DSShow all
3 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{color-…
cs.DS2024
Balanced Substructures in Bicolored Graphs
P. S. Ardra, R. Krithika, Saket Saurabh +1
An edge-colored graph is said to be balanced if it has an equal number of edges of each color. Given a graph whose edges are colored using two colors and a positive integer …
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…