Zobrazeno 1 - 10
of 20
pro vyhledávání: '"Jasine Babu"'
Autor:
Jasine Babu, Veena Prabhakaran, Mathew C. Francis, Deepak Rajendraprasad, Nandini J Warrier, L. Sunil Chandran
Publikováno v:
Discrete Applied Mathematics. 319:171-182
The eternal vertex cover problem is a variant of the classical vertex cover problem defined in terms of an infinite attacker–defender game played on a graph. In each round of the game, the defender reconfigures guards from one vertex cover to anoth
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::237d25252b914570e0b88ed6561c3dfb
https://doi.org/10.1016/j.dam.2021.02.004
https://doi.org/10.1016/j.dam.2021.02.004
Publikováno v:
Discrete Applied Mathematics. 304:432-440
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f658d02416dd8e22e204fa9bf2010241
https://doi.org/10.1016/j.dam.2021.08.021
https://doi.org/10.1016/j.dam.2021.08.021
Publikováno v:
Theoretical Computer Science. 890:87-104
The eternal vertex cover (EVC) problem is to compute the minimum number of guards to be placed on the vertices of a graph so that any sequence of attacks on its edges can be defended by dynamically reconfiguring the guards. The problem is NP-hard in
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f363759808cb061467511e0a0ee6cbca
https://doi.org/10.1016/j.tcs.2021.08.018
https://doi.org/10.1016/j.tcs.2021.08.018
Autor:
Jasine Babu, Veena Prabhakaran
Publikováno v:
Journal of Combinatorial Optimization. 44:2482-2498
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::8ff854092ed289af2547ef60fe66b169
https://doi.org/10.1007/s10878-021-00764-8
https://doi.org/10.1007/s10878-021-00764-8
Publikováno v:
Theoretical Computer Science. 840:45-58
We derive a local criterion for a plane near-triangulated graph to be perfect. It is shown that a plane near-triangulated graph is perfect if and only if it does not contain either a vertex, an edge or a triangle, the neighbourhood of which has an od
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::3c7037ba3fd182681d02406310aa5c24
https://doi.org/10.1016/j.tcs.2020.06.031
https://doi.org/10.1016/j.tcs.2020.06.031
Publikováno v:
Computer Science – Theory and Applications ISBN: 9783031095733
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d4cee456a9880254b231a6df75d7ac75
https://doi.org/10.1007/978-3-031-09574-0_5
https://doi.org/10.1007/978-3-031-09574-0_5
A mixed multigraph is a multigraph which may contain both undirected and directed edges. An orientation of a mixed multigraph $G$ is an assignment of exactly one direction to each undirected edge of $G$. A mixed multigraph $G$ can be oriented to a st
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::e78d4f104f9b30bf6dd7163338ceaec3
Publikováno v:
Electronic Notes in Discrete Mathematics. 61:69-75
Given a graph $G=(V,E)$ whose vertices have been properly coloured, we say that a path in $G$ is "colourful" if no two vertices in the path have the same colour. It is a corollary of the Gallai-Roy-Vitaver Theorem that every properly coloured graph c
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::06efe4c1852ced3766e14d728341c10c
https://doi.org/10.1016/j.endm.2017.06.022
https://doi.org/10.1016/j.endm.2017.06.022
Autor:
Veena Prabhakaran, Jasine Babu
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783030581497
COCOON
COCOON
We obtain a new lower bound for the eternal vertex cover number of an arbitrary graph G, in terms of the cardinality of a vertex cover of minimum size in G containing all its cut vertices. The consequences of the lower bound include a quadratic time
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ac924427e19ee39537576da5085e9b49
https://doi.org/10.1007/978-3-030-58150-3_3
https://doi.org/10.1007/978-3-030-58150-3_3
Publikováno v:
Computer Science – Theory and Applications ISBN: 9783030500252
CSR
CSR
An orientation of an undirected graph G is an assignment of exactly one direction to each edge of G. The oriented diameter of a graph G is the smallest diameter among all the orientations of G. The maximum oriented diameter of a family of graphs \(\m
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::5cd3243470c3ca6198c4510d94547ca6
https://doi.org/10.1007/978-3-030-50026-9_8
https://doi.org/10.1007/978-3-030-50026-9_8