2 citations · 2 across the 3 of their papers we have counts for
Showing cs.DSShow all
2 papers · 1 filter
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
Revisiting Path Contraction and Cycle Contraction
R. Krithika, V. K. Kutty Malu, Prafullkumar Tale
The Path Contraction and Cycle Contraction problems take as input an undirected graph with vertices, edges and an integer and determine whether one can obtain a pat…