Zobrazeno 1 - 10
of 18
pro vyhledávání: '"Anjeneya Swami Kare"'
Publikováno v:
Discrete Applied Mathematics. 319:254-270
In an undirected graph, a matching cut is a partition of vertices into two sets such that the edges across the sets induce a matching. The Matching Cut problem is the problem of deciding whether a given graph has a matching cut. Let H be a fixed undi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::1e0a892d46b12f6615655547aceb33a1
https://doi.org/10.1016/j.dam.2021.05.016
https://doi.org/10.1016/j.dam.2021.05.016
Autor:
Leela Srija Alla, Anjeneya Swami Kare
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783031248474
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::56d243920d8018cac509988a7f221da5
https://doi.org/10.1007/978-3-031-24848-1_9
https://doi.org/10.1007/978-3-031-24848-1_9
Publikováno v:
Algorithms and Discrete Applied Mathematics ISBN: 9783031252105
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::eb9a53b1c9caad03ec48608fd1bc6d12
https://doi.org/10.1007/978-3-031-25211-2_34
https://doi.org/10.1007/978-3-031-25211-2_34
Publikováno v:
CALDAM
In an undirected graph, a proper (k, i)-coloring is an assignment of a set of k colors to each vertex such that any two adjacent vertices have at most i common colors. The (k, i)-coloring problem is to compute the minimum number of colors required fo
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e82f19b5f0937c7d9da15a367a266451
https://doi.org/10.1016/j.dam.2020.08.018
https://doi.org/10.1016/j.dam.2020.08.018
Publikováno v:
Applied Intelligence
Graph burning is a process of information spreading through the network by an agent in discrete steps. The problem is to find an optimal sequence of nodes which have to be given information so that the network is covered in least number of steps. Gra
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::3e336b01c6dfa513d5c77e1994f1efa9
http://europepmc.org/articles/PMC8134828
http://europepmc.org/articles/PMC8134828
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:
Anjeneya Swami Kare, Varun Kumar
Publikováno v:
ICCCNT
In this paper, we propose heuristics for the $(k, i){-}$ coloring problem, which is a generalization of classical graph coloring problem. We also explore an application of $(k, i)$ -coloring problem to coding theory. In an undirected graph, a proper
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::8e0818275cccaa482ea7b9fd882a4113
https://doi.org/10.1109/icccnt51525.2021.9579935
https://doi.org/10.1109/icccnt51525.2021.9579935
Autor:
Anjeneya Swami Kare, Sreshta Valluru
Publikováno v:
ICCCNT
A power grid is an interconnected network to distribute electricity generated from power stations to consumers. If the supply and the demand of the power grid is not matched, there will be power outages. To avoid this situation, the power grid should
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::bf009a486f755b300e22b9befe0eb9db
https://doi.org/10.1109/icccnt49239.2020.9225596
https://doi.org/10.1109/icccnt49239.2020.9225596
Publikováno v:
Algorithms and Discrete Applied Mathematics ISBN: 9783030115081
CALDAM
CALDAM
Let H be a fixed undirected graph. A vertex coloring of an undirected input graph G is said to be an \(H\)-Free Coloring if none of the color classes contain H as an induced subgraph. The \(H\)-Free Chromatic Number of G is the minimum number of colo
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::24e05c2fee4b5882340e1a10acc27e36
https://doi.org/10.1007/978-3-030-11509-8_19
https://doi.org/10.1007/978-3-030-11509-8_19
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