Zobrazeno 1 - 4
of 4
pro vyhledávání: '"Harshita, Kona"'
Autor:
Harshita, Kona, Sadagopan, N.
The family of graphs that can be constructed from isolated vertices by disjoint union and graph join operations are called cographs. These graphs can be represented in a tree-like representation termed parse tree or cotree. In this paper, we study so
Externí odkaz:
http://arxiv.org/abs/1808.09117
The focus of this paper is two fold. Firstly, we present a logical approach to graph modification problems such as minimum node deletion, edge deletion, edge augmentation problems by expressing them as an expression in first order (FO) logic. As a co
Externí odkaz:
http://arxiv.org/abs/1711.02889
Autor:
Harshita Kona, N. Sadagopan
The family of graphs that can be constructed from isolated vertices by disjoint union and graph join operations are called cographs. These graphs can be represented in a tree-like representation termed parse tree or cotree. In this paper, we study so
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::ecc74b0a110c277c1f06d39f87c43235
http://arxiv.org/abs/1808.09117
http://arxiv.org/abs/1808.09117
Autor:
Kona, Harshita, Sadagopan, N.
Publikováno v:
International Journal of Advances in Engineering Sciences & Applied Mathematics; Mar2019, Vol. 11 Issue 1, p25-39, 15p