8 papers
Minimum Selective Subset on Unit Disk Graphs and Circle Graphs
Bubai Manna
In a connected simple graph G = (V(G),E(G)), each vertex is assigned one of c colors, where V(G) can be written as a union of a total of c subsets V_{1},...,V_{c} and V_{i} denotes…
Minimum Selective Subset on Some Graph Classes
Bubai Manna
In a connected simple graph G = (V(G),E(G)), each vertex is assigned a color from the set of colors C={1, 2,..., c}. The set of vertices V(G) is partitioned as V_1, V_2, ... ,V_c,…
Minsum Problem for Discrete and Weighted Set Flow on Dynamic Path Network
Bubai Manna, Bodhayan Roy, Vorapong Suppakitpaisarn
In this research, we examine the minsum flow problem in dynamic path networks where flows are represented as discrete and weighted sets. The minsum flow problem has been widely stu…
Minimum Consistent Subset in Interval Graphs and Circle Graphs
Bubai Manna
In a connected simple graph G = (V,E), each vertex of V is colored by a color from the set of colors C={c1, c2,..., c_α}$. We take a subset S of V, such that for every vertex v in…
Minimum Strict Consistent Subset in Paths, Spiders, Combs and Trees
Bubai Manna
Let G be a simple connected graph with vertex set V(G) and edge set E(G. Each vertex of V(G) is colored by a color from the set of colors {c_1, c_2,\dots, c_α}. We take a subset S…
On Approximating the Dynamic and Discrete Network Flow Problem
Bubai Manna, Bodhayan Roy, Vorapong Suppakitpaisarn
We examine the dynamic network flow problem under the assumption that the flow consists of discrete units. The dynamic network flow problem is commonly addressed in the context of…
New Complexity and Algorithmic Bounds for Minimum Consistent Subsets
Aritra Banik, Sayani Das, Anil Maheshwari +6
In the Minimum Consistent Subset (MCS) problem, we are presented with a connected simple undirected graph , consisting of a vertex set of size and an edge set .…
Some results on Minimum Consistent Subsets of Trees
Bubai Manna, Bodhayan Roy
For a graph G = (V,E) where each vertex is coloured by one of k colours, consider a subset C of V such that for each vertex v in V\C, its set of nearest neighbours in C contains at…