Zobrazeno 1 - 10
of 60
pro vyhledávání: '"Soumen Maity"'
Autor:
Ajinkya Gaikwad, Soumen Maity
Publikováno v:
Theoretical Computer Science. 933:125-137
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::fb7b25edd58a68bf0fda110a6cf43675
https://doi.org/10.1016/j.tcs.2022.08.025
https://doi.org/10.1016/j.tcs.2022.08.025
Publikováno v:
Theoretical Computer Science. 907:113-127
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b88d9a37b771df877cee4a43fcff18df
https://doi.org/10.1016/j.tcs.2022.01.022
https://doi.org/10.1016/j.tcs.2022.01.022
Autor:
Garima Agrawal, Soumen Maity
Publikováno v:
Theoretical Computer Science. 886:84-93
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d1e6280215aa198b56d901d5a7b00a06
https://doi.org/10.1016/j.tcs.2021.07.017
https://doi.org/10.1016/j.tcs.2021.07.017
Publikováno v:
Emerging Technologies in Data Mining and Information Security ISBN: 9789811941924
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f09777221b6ee2d1ff2bd223dac4295c
https://doi.org/10.1007/978-981-19-4193-1_35
https://doi.org/10.1007/978-981-19-4193-1_35
Publikováno v:
CSR
Given a graph \(G=(V,E)\), a subset \(S\subseteq V(G)\) is said to be a feedback vertex set of G if \(G-S\) is a forest. In the Feedback Vertex Set (FVS) problem, we are given an undirected graph G, and a positive integer k, the question is whether t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::483b6649a1ef8694a3ef921dd4cfc5d3
https://doi.org/10.1016/j.tcs.2021.03.008
https://doi.org/10.1016/j.tcs.2021.03.008
Publikováno v:
Algorithms and Discrete Applied Mathematics ISBN: 9783030950170
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d269746454c4c7876de76bde45d4c7f6
https://doi.org/10.1007/978-3-030-95018-7_22
https://doi.org/10.1007/978-3-030-95018-7_22
Autor:
Ajinkya Gaikwad, Soumen Maity
Publikováno v:
WALCOM: Algorithms and Computation ISBN: 9783030967307
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::56a05008edb0ab65c05c80775a3456e1
https://doi.org/10.1007/978-3-030-96731-4_19
https://doi.org/10.1007/978-3-030-96731-4_19
Autor:
Ajinkya Gaikwad, Soumen Maity
A set $S$ of vertices of a graph is a defensive alliance if, for each element of $S$, the majority of its neighbours are in $S$. We study the parameterized complexity of the Defensive Alliance problem, where the aim is to find a minimum size defensiv
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::41cfb0fda1e2507c25fb977afd37d018
http://arxiv.org/abs/2111.05545
http://arxiv.org/abs/2111.05545
Autor:
Soumen Maity, Charles J. Colbourn
Publikováno v:
Discrete Mathematics, Algorithms and Applications. 14
Covering arrays are combinatorial objects that have been successfully applied in design of test suites for testing systems such as software, hardware, and networks where failures can be caused by the interaction between their parameters. Let [Formula
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::39ec1de624877a01928a37b57b1802b0
https://doi.org/10.1142/s1793830921500853
https://doi.org/10.1142/s1793830921500853
Publikováno v:
Algorithms and Discrete Applied Mathematics ISBN: 9783030678982
CALDAM
CALDAM
A defensive alliance in a graph \(G=(V,E)\) is a set of vertices S satisfying the condition that every vertex \(v\in S\) has at least as many neighbours (including itself) in S as it has in \(V{\setminus }S\). We consider the notion of local minimali
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::aafc8bf83555d4a573028b8f938e4d3e
https://doi.org/10.1007/978-3-030-67899-9_11
https://doi.org/10.1007/978-3-030-67899-9_11