Polynomial enumeration of chordless cycles on cyclically orientable graphs

Página do item simplificado
dc.creatorCastonguay, Diane
dc.creatorDias, Elisângela Silva
dc.date.accessioned2020-12-29T17:29:43Z
dc.date.available2020-12-29T17:29:43Z
dc.date.issued2015
dc.description.abstractIn a nite undirected simple graph, a chordless cycle is an induced subgraph which is a cycle. A graph is called cyclically orientable if it admits an orientation in which every chordless cycle is cyclically oriented. We propose an algorithm to enumerate all chordless cycles of such a graph. Compared to other similar algorithms, the proposed algorithm has the advantage of nding each chordless cycle only once in time complexity O(n2), where n is the number of vertices.pt_BR
dc.identifier.citationCASTONGUAY, Daine; DIAS, Elisângela Silva. Polynomial enumeration of chordless cycles on cyclically orientable graphs. Matematica Contemporanea, Rio de Janeiro, v. 44, p. 1-10, 2015.pt_BR
dc.identifier.issne- 2713-6636
dc.identifier.urihttp://repositorio.bc.ufg.br/handle/ri/19276
dc.language.isoengpt_BR
dc.publisher.countryBrasilpt_BR
dc.publisher.departmentInstituto de Informática - INF (RG)pt_BR
dc.rightsAcesso Abertopt_BR
dc.rights.urihttp://creativecommons.org/licenses/by-nc-nd/4.0/*
dc.subjectChordless cyclespt_BR
dc.subjectCyclically orientable graphspt_BR
dc.titlePolynomial enumeration of chordless cycles on cyclically orientable graphspt_BR
dc.typeArtigopt_BR

Arquivos

Pacote Original
Agora exibindo 1 - 1 de 1
Imagem de Miniatura
Nome:
Artigo - Diane Castonguay - 2015.pdf
Tamanho:
252.36 KB
Formato:
Adobe Portable Document Format
Descrição:
Baixar
Licença do Pacote
Agora exibindo 1 - 1 de 1
Nenhuma Miniatura disponível
Nome:
license.txt
Tamanho:
1.71 KB
Formato:
Item-specific license agreed upon to submission
Descrição:
Baixar

Coleções

INF - Artigos publicados em periódicos