3 papers
cs.DS2026
Vertex-Coloring Edge-Weighting: Kernelization and Generalization
Shubhada Aute, Fahad Panolan, Geevarghese Philip
An edge weighting of a graph induces a coloring of its vertices in which the color of a vertex is the total weight of the edges incident with it. Such an edge weighting is proper i…
cs.DS2026
The Parameterized Complexity of Vertex-Coloring Edge-Weighting
Shubhada Aute, Fahad Panolan, Geevarghese Philip
Motivated by the landmark resolution of the 1-2-3 Conjecture, we initiate the study of the parameterized complexity of the Vertex-Coloring {0,1}-Edge-Weighting problem and its gene…
cs.DS2024
Parameterized Algorithms for Minimum Sum Vertex Cover
Shubhada Aute, Fahad Panolan
Minimum sum vertex cover of an -vertex graph is a bijection that minimizes the cost . Finding a minimum sum v…