Zobrazeno 1 - 6
of 6
pro vyhledávání: '"Paulo Renato da Costa Pereira"'
Publikováno v:
Discrete Applied Mathematics. 164:297-303
A subfamily of k-trees, the k-path graphs generalize path graphs in the same way k-trees generalize trees. This paper presents a code for unlabeled k-path graphs. The effect of structural properties of the family on the code is investigated, leading
Autor:
Clícia Valladares Peixoto Friedmann, Paulo Renato da Costa Pereira, Christina Fraga Esteves Maciel Waga, Abel Rodolfo Garcia Lozano, Lilian Markenzon
Publikováno v:
Operations Research Letters. 41:331-335
In this paper, a representation for chordal graphs called the compact representation , based on the running intersection property, is presented. It provides the means to immediately deduce several structural properties of a chordal graph such as a pe
Publikováno v:
International Transactions in Operational Research. 20:681-688
Publikováno v:
International Transactions in Operational Research. 17:683-690
The set of minimal vertex separators of chordal graphs is usually obtained by two-phase algorithms. Based on properties of the lexicographic breadth-first search, we propose a new one-phase algorithm. We present also a characterization for planar cho
Publikováno v:
Pesquisa Operacional, Vol 29, Iss 3, Pp 493-502 (2009)
Pesquisa Operacional, Volume: 29, Issue: 3, Pages: 493-502, Published: DEC 2009
Pesquisa Operacional v.29 n.3 2009
Pesquisa operacional
Sociedade Brasileira de Pesquisa Operacional (SOBRAPO)
instacron:SOBRAPO
Pesquisa Operacional, Volume: 29, Issue: 3, Pages: 493-502, Published: DEC 2009
Pesquisa Operacional v.29 n.3 2009
Pesquisa operacional
Sociedade Brasileira de Pesquisa Operacional (SOBRAPO)
instacron:SOBRAPO
In this paper, we propose a new representation for k-trees - the compact code, which reduces the required memory space from O(nk) to O(n). The encoding and decoding algorithms, based on a simplification of a priority queue, are linear and very simple
Publikováno v:
Discrete Applied Mathematics. 156:3216-3222
We present in this paper a codeword for labelled k-path graphs. Structural properties of this codeword are investigated, leading to the solution of two important problems: determining the exact number of labelled k-path graphs with n vertices and loc