Pantheon Institutional repository
Collect, preserve and disseminate digital academic production in all areas of knowledge.
Comprise the assets of the repository, in addition to theses and dissertations at UFRJ, scientific articles, electronic books, book chapters and papers presented at events for teachers, researchers, administrative staff and students of master's and doctoral degrees.
Please use this identifier to cite or link to this item:
http://hdl.handle.net/11422/1643| Type: | Relatório |
| Title: | A note of the computation of the k-closure of a graph |
| Author(s)/Inventor(s): | Szwarcfiter, Jayme Luiz |
| Abstract: | Bondy e Chvátal apresentaram o conceito de k-fechamento de um grafo e descreveram um algoritmo que o constrói em 0 (n4) passos. Nessa nota apresenta-se um método cuja complexidade é 0 (n³). |
| Abstract: | Bondy and Chvátal introduced the concept of k-closure of a graph and described an algorithm which constructs it in 0 (n4) steps. In this note is presented a method having complexity 0 (n³). |
| Keywords: | Teoria dos grafos Algoritmos |
| Subject CNPq: | CNPQ::CIENCIAS EXATAS E DA TERRA::CIENCIA DA COMPUTACAO |
| Production unit: | Instituto Tércio Pacitti de Aplicações e Pesquisas Computacionais |
| In: | Relatório Técnico NCE |
| Issue: | 0286 |
| Issue Date: | 31-Jan-1986 |
| Publisher country: | Brasil |
| Language: | eng |
| Right access: | Acesso Aberto |
| Citation: | SZWARCFITER, J. L. A note of the computation of the k-closure of a graph. Rio de Janeiro: NCE, UFRJ, 1985. 4 p. (Relatório Técnico, 02/86) |
| Appears in Collections: | Relatórios |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| 02_86_000040324.pdf | 445.38 kB | Adobe PDF | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.