Zobrazeno 1 - 10
of 23
pro vyhledávání: '"I. Vinod Reddy"'
Publikováno v:
Algorithms and Discrete Applied Mathematics ISBN: 9783031252105
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a397509c4b08e63ce1e557f63658cb36
https://doi.org/10.1007/978-3-031-25211-2_11
https://doi.org/10.1007/978-3-031-25211-2_11
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783031304477
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::edc6768524491503892672149d92b167
https://doi.org/10.1007/978-3-031-30448-4_9
https://doi.org/10.1007/978-3-031-30448-4_9
Autor:
Sriram Bhyravarapu, I. Vinod Reddy
Publikováno v:
Algorithms and Discrete Applied Mathematics ISBN: 9783031252105
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::93827ef7799349bc51f5b85cb77bb2d9
https://doi.org/10.1007/978-3-031-25211-2_12
https://doi.org/10.1007/978-3-031-25211-2_12
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Autor:
Juho Lauri, Neeldhara Misra, Akanksha Agrawal, Subrahmanyam Kalyanasundaram, Anjeneya Swami Kare, I. Vinod Reddy, N. R. Aravind
Publikováno v:
Theoretical Computer Science. 835:58-81
In a vertex-colored graph, an edge is happy if its endpoints have the same color. Similarly, a vertex is happy if all its incident edges are happy. Motivated by the computation of homophily in social networks, we consider the algorithmic aspects of t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::42f6803676e3c21df7a3c69700dd6946
https://doi.org/10.1016/j.tcs.2020.06.002
https://doi.org/10.1016/j.tcs.2020.06.002
Autor:
I. Vinod Reddy
Publikováno v:
Algorithms and Discrete Applied Mathematics ISBN: 9783030678982
CALDAM
CALDAM
Given a graph G and a positive integer k, the 2-Load Coloring problem is to check whether there is a 2-coloring \(f:V(G) \rightarrow \{r,b\}\) of G such that for every \(i \in \{r,b\}\), there are at least k edges with both end vertices colored i. It
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::89e4078ad635e7bd351c468b30341272
https://doi.org/10.1007/978-3-030-67899-9_9
https://doi.org/10.1007/978-3-030-67899-9_9
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783030799861
IWOCA
IWOCA
Given an undirected graph, a conflict-free coloring (CFON*) is an assignment of colors to a subset of the vertices of the graph such that for every vertex there exists a color that is assigned to exactly one vertex in its open neighborhood. The minim
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::4d699546f5a631432294b8ceec6bd6e1
https://doi.org/10.1007/978-3-030-79987-8_7
https://doi.org/10.1007/978-3-030-79987-8_7
Publikováno v:
Information Processing Letters. 139:64-67
In this paper, we show that for a fixed k, there is an NC algorithm that separates the graphs of rank-width at most k from those with rank-width at least
by Bireswar Das, Anirban Dasgupta, Murali Krishna Enduri, and Vinod I. Reddy
2018-08-1
by Bireswar Das, Anirban Dasgupta, Murali Krishna Enduri, and Vinod I. Reddy
2018-08-1
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::ffdd3c73f60277bd19055a87dd4d56f6
https://doi.org/10.1016/j.ipl.2018.07.007
https://doi.org/10.1016/j.ipl.2018.07.007
Autor:
Bireswar Das, Murali Krishna Enduri, Masashi Kiyomi, Neeldhara Misra, Yota Otachi, I. Vinod Reddy, Shunya Yoshimura
Publikováno v:
CALDAM
he Firefighting problem is defined as follows. At time , a fire breaks out at a vertex of a graph. At each time step, a firefighter permanently defends (protects) an unburned vertex, and the fire then spreads to all undefended neighbors from the vert
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::0d8aaf1f556874684a3b84f30003ccc9
https://repository.iitgn.ac.in/handle/123456789/4289
https://repository.iitgn.ac.in/handle/123456789/4289
Autor:
I. Vinod Reddy, Anjeneya Swami Kare
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783030250041
IWOCA
IWOCA
The Graph Burning problem is defined as follows. At time \(t=0\), no vertex of the graph is burned. At each time \(t \ge 1\), we choose a vertex to burn. If a vertex is burned at time t, then at time \(t+1\) each of its unburned neighbors becomes bur
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::7a284b1a741c11b689b610af913dd6ab
https://doi.org/10.1007/978-3-030-25005-8_25
https://doi.org/10.1007/978-3-030-25005-8_25