Zobrazeno 1 - 4
of 4
pro vyhledávání: '"Nandini J Warrier"'
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
Publikováno v:
Procedia Computer Science. 171:755-760
The aim of graph clustering is to partition the given graph into subgraphs, and then assign the subgraphs to overlapping or non-overlapping clusters. In this process, densely connected subgraphs fall into a single cluster, thereby maximizing the intr
A plane near-triangulation G can be decomposed into a collection of induced subgraphs, described here as the W-components of G, such that G is perfect (respectively, chordal) if and only if each of its W-components is perfect (respectively, chordal).
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::0320af749af93874e21ff4da9fcf6d62
http://arxiv.org/abs/1701.03447
http://arxiv.org/abs/1701.03447
Publikováno v:
International Journal of Computer Applications. 7:14-21
With the availability of limited electronic resources, development of a syntactic parser for all types of sentence forms is a challenging and demanding task for any natural language. This paper presents the development of Penn Treebank based statisti