Upload resources

Upload your works to SEDICI to increase its visibility and improve its impact

 

Show simple item record

dc.date.accessioned 2020-04-21T14:15:52Z
dc.date.available 2020-04-21T14:15:52Z
dc.date.issued 2009
dc.identifier.uri http://sedici.unlp.edu.ar/handle/10915/93883
dc.description.abstract 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. en
dc.format.extent 153-160 es
dc.language en es
dc.subject Leaf es
dc.subject Compatible tree es
dc.subject Clique tree es
dc.subject Chordal es
dc.subject Dually chordal es
dc.title Determining possible sets of leaves for spanning trees of dually chordal graphs en
dc.type Objeto de conferencia es
sedici.creator.person De Caria, Pablo Jesús es
sedici.creator.person Gutiérrez, Marisa es
sedici.subject.materias Matemática es
sedici.description.fulltext true es
mods.originInfo.place Facultad de Ciencias Exactas es
sedici.subtype Objeto de conferencia es
sedici.rights.license Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0)
sedici.rights.uri http://creativecommons.org/licenses/by-nc-sa/4.0/
sedici.date.exposure 2009
sedici.relation.event II Congreso de Matemática Aplicada, Computacional e Industrial (MACI) (Rosario, 14 al 16 de diciembre de 2009) es
sedici.description.peerReview peer-review es


Download Files

Thumbnail
Documento completo
Download file (679.5Kb) - PDF

This item appears in the following Collection(s)

Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0) Except where otherwise noted, this item's license is described as Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0)