Zobrazeno 1 - 10
of 10
pro vyhledávání: '"Subhrangsu Mandal"'
Autor:
Avisankar Chini, Subhrangsu Mandal
Publikováno v:
The FASEB Journal. 36
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::1ca8af309a71187c8cf47bfd00b265ba
https://doi.org/10.1096/fasebj.2022.36.s1.r6280
https://doi.org/10.1096/fasebj.2022.36.s1.r6280
Autor:
Subhrangsu Mandal, Arobinda Gupta
Publikováno v:
International Journal of Foundations of Computer Science. 31:385-409
Temporal graphs are useful tools to model dynamic network topologies found in many applications. In this paper, we address the problem of constructing a convergecast tree on temporal graphs for data collection in dynamic sensor networks. Two types of
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c90c1d751cc17a862dd98ddf0d1d8a55
https://doi.org/10.1142/s012905412050015x
https://doi.org/10.1142/s012905412050015x
Publikováno v:
Journal of Biological Chemistry. 299:104349
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::46746832c29d14111158b546f7a3ef95
https://doi.org/10.1016/j.jbc.2023.104349
https://doi.org/10.1016/j.jbc.2023.104349
Publikováno v:
Journal of Biological Chemistry. 299:104243
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::492cce18f60db3316995134d41f38667
https://doi.org/10.1016/j.jbc.2023.104243
https://doi.org/10.1016/j.jbc.2023.104243
Publikováno v:
Algorithms for Sensor Systems ISBN: 9783030624002
ALGOSENSORS
ALGOSENSORS
The graph exploration problem requires a group of mobile robots, initially placed arbitrarily on the nodes of a graph, to work collaboratively to explore the graph such that each node is eventually visited by at least one robot. One important require
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::3fe9f8440bd2af85677d1370357f6c94
https://doi.org/10.1007/978-3-030-62401-9_7
https://doi.org/10.1007/978-3-030-62401-9_7
Autor:
Subhrangsu Mandal, Arobinda Gupta
Publikováno v:
Algorithms and Discrete Applied Mathematics ISBN: 9783030392185
CALDAM
CALDAM
Temporal graphs are introduced to model dynamic networks where the set of edges and/or nodes can change with time. In this paper, we define 0-1 timed matching for temporal graphs, and address the problem of finding the maximum 0-1 timed matching for
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a87d95dbc6551d3e2be31d66d9dab4ad
https://doi.org/10.1007/978-3-030-39219-2_27
https://doi.org/10.1007/978-3-030-39219-2_27
Autor:
Arobinda Gupta, Subhrangsu Mandal
Publikováno v:
Distributed Computing and Internet Technology ISBN: 9783319723433
ICDCIT
ICDCIT
A temporal graph is a graph whose node and/or edge set changes with time. Many dynamic networks in practice can be modeled as temporal graphs with different properties. Finding different types of dominating sets in such graphs is an important problem
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::dd703917533c11996a78afd2b4cab60a
https://doi.org/10.1007/978-3-319-72344-0_22
https://doi.org/10.1007/978-3-319-72344-0_22
Publikováno v:
Peer-to-Peer Networking and Applications. 8:63-86
Data management in the peer-to-peer system is a challenging task due to the random distribution of data among several participating peers. Efficient data structures like distributed hash tables (DHT) and its variants are designed and implemented to r
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::55f563e03094efe8442fd2dd6854e290
https://doi.org/10.1007/s12083-013-0222-6
https://doi.org/10.1007/s12083-013-0222-6
Autor:
Arobinda Gupta, Subhrangsu Mandal
Publikováno v:
COMSNETS
We present a greedy approximation algorithm to solve the problem of finding a minimum permanent dominating set for a given dynamic graph represented using the evolving graphs model. The node set of the dynamic graph is static and only the edge set ch
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::5aae40f09228c96d55aefaee125df7f4
https://doi.org/10.1109/comsnets.2016.7439959
https://doi.org/10.1109/comsnets.2016.7439959
Publikováno v:
2012 2nd IEEE International Conference on Parallel, Distributed and Grid Computing.
Searching data efficiently in distributed applications like peer-to-peer system is a challenging task due to the random distribution of data among several participating nodes. Efficient data structures are designed and implemented to reduce the compl
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b9c4dab094771f18b6487b751b60d047
https://doi.org/10.1109/pdgc.2012.6449835
https://doi.org/10.1109/pdgc.2012.6449835