Zobrazeno 1 - 9
of 9
pro vyhledávání: '"Bandopadhyay, Susobhan"'
An \textit{$(n,m)$-graph} $G$ is a graph having both arcs and edges, and its arcs (resp., edges) are labeled using one of the $n$ (resp., $m$) different symbols. An \textit{$(n,m)$-complete graph} $G$ is an $(n,m)$-graph without loops or multiple edg
Externí odkaz:
http://arxiv.org/abs/2409.05678
Autor:
Bandopadhyay, Susobhan, Banik, Aritra, Gupta, Sushmita, Jain, Pallavi, Sahu, Abhishek, Saurabh, Saket, Tale, Prafullkumar
In the standard model of fair allocation of resources to agents, every agent has some utility for every resource, and the goal is to assign resources to agents so that the agents' welfare is maximized. Motivated by job scheduling, interest in this pr
Externí odkaz:
http://arxiv.org/abs/2403.04265
We study the SHORTEST PATH problem with positive disjunctive constraints from the perspective of parameterized complexity. For positive disjunctive constraints, there are certain pair of edges such that any feasible solution must contain at least one
Externí odkaz:
http://arxiv.org/abs/2309.04346
Given an undirected graph $G$ and $q$ integers $n_1,n_2,n_3, \cdots, n_q$, balanced connected $q$-partition problem ($BCP_q$) asks whether there exists a partition of the vertex set $V$ of $G$ into $q$ parts $V_1,V_2,V_3,\cdots, V_q$ such that for al
Externí odkaz:
http://arxiv.org/abs/2202.12042
For two given nonnegative integers $h$ and $k$, an $L(h,k)$-edge labeling of a graph $G$ is the assignment of labels $\{0,1, \cdots, n\}$ to the edges so that two edges having a common vertex are labeled with difference at least $h$ and two edges not
Externí odkaz:
http://arxiv.org/abs/2201.06801
We introduce a variant of the graph coloring problem, which we denote as {\sc Budgeted Coloring Problem} (\bcp). Given a graph $G$, an integer $c$ and an ordered list of integers $\{b_1, b_2, \ldots, b_c\}$, \bcp asks whether there exists a proper co
Externí odkaz:
http://arxiv.org/abs/2110.14498
Publikováno v:
In Theoretical Computer Science 9 January 2023 942:47-56
Publikováno v:
In Theoretical Computer Science 9 January 2023 940 Part A:209-221
Autor:
Abhinav, Ankit, Bandopadhyay, Susobhan, Banik, Aritra, Kobayashi, Yasuaki, Nagano, Shunsuke, Otachi, Yota, Saurabh, Saket
For a connected graph G = (V, E) and s, t ∈ V, a non-separating s-t path is a path P between s and t such that the set of vertices of P does not separate G, that is, G - V(P) is connected. An s-t path P is non-disconnecting if G - E(P) is connected
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::28b88260d42cc12465726f7ce19279d5