Objeto de conferencia
Determining possible sets of leaves for spanning trees of dually chordal graphs
Autor
De Caria, Pablo Jesús
Gutiérrez, Marisa
Institución
Resumen
It will be proved that the problem of determining whether a set of vertices of a dually chordal graphs is the set of leaves of a tree compatible with it can be solved in polynomial time by establishing a connection with finding clique trees of chordal graphs with minimum number of leaves. Facultad de Ciencias Exactas