Determining possible sets of leaves for spanning trees of dually chordal graphs
- Autores
- De Caria, Pablo Jesús; Gutiérrez, Marisa
- Año de publicación
- 2009
- Idioma
- inglés
- Tipo de recurso
- documento de conferencia
- Estado
- versión publicada
- Descripción
- 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 - Materia
-
Matemática
Leaf
Compatible tree
Clique tree
Chordal
Dually chordal - Nivel de accesibilidad
- acceso abierto
- Condiciones de uso
- http://creativecommons.org/licenses/by-nc-sa/4.0/
- Repositorio
.jpg)
- Institución
- Universidad Nacional de La Plata
- OAI Identificador
- oai:sedici.unlp.edu.ar:10915/93883
Ver los metadatos del registro completo
| id |
SEDICI_1c85e56db9e0e0a7b39a36eaf7c3c345 |
|---|---|
| oai_identifier_str |
oai:sedici.unlp.edu.ar:10915/93883 |
| network_acronym_str |
SEDICI |
| repository_id_str |
1329 |
| network_name_str |
SEDICI (UNLP) |
| spelling |
Determining possible sets of leaves for spanning trees of dually chordal graphsDe Caria, Pablo JesúsGutiérrez, MarisaMatemáticaLeafCompatible treeClique treeChordalDually chordalIt 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 Exactas2009info:eu-repo/semantics/conferenceObjectinfo:eu-repo/semantics/publishedVersionObjeto de conferenciahttp://purl.org/coar/resource_type/c_5794info:ar-repo/semantics/documentoDeConferenciaapplication/pdf153-160http://sedici.unlp.edu.ar/handle/10915/93883enginfo:eu-repo/semantics/openAccesshttp://creativecommons.org/licenses/by-nc-sa/4.0/Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0)reponame:SEDICI (UNLP)instname:Universidad Nacional de La Platainstacron:UNLP2025-10-15T11:11:26Zoai:sedici.unlp.edu.ar:10915/93883Institucionalhttp://sedici.unlp.edu.ar/Universidad públicaNo correspondehttp://sedici.unlp.edu.ar/oai/snrdalira@sedici.unlp.edu.arArgentinaNo correspondeNo correspondeNo correspondeopendoar:13292025-10-15 11:11:26.474SEDICI (UNLP) - Universidad Nacional de La Platafalse |
| dc.title.none.fl_str_mv |
Determining possible sets of leaves for spanning trees of dually chordal graphs |
| title |
Determining possible sets of leaves for spanning trees of dually chordal graphs |
| spellingShingle |
Determining possible sets of leaves for spanning trees of dually chordal graphs De Caria, Pablo Jesús Matemática Leaf Compatible tree Clique tree Chordal Dually chordal |
| title_short |
Determining possible sets of leaves for spanning trees of dually chordal graphs |
| title_full |
Determining possible sets of leaves for spanning trees of dually chordal graphs |
| title_fullStr |
Determining possible sets of leaves for spanning trees of dually chordal graphs |
| title_full_unstemmed |
Determining possible sets of leaves for spanning trees of dually chordal graphs |
| title_sort |
Determining possible sets of leaves for spanning trees of dually chordal graphs |
| dc.creator.none.fl_str_mv |
De Caria, Pablo Jesús Gutiérrez, Marisa |
| author |
De Caria, Pablo Jesús |
| author_facet |
De Caria, Pablo Jesús Gutiérrez, Marisa |
| author_role |
author |
| author2 |
Gutiérrez, Marisa |
| author2_role |
author |
| dc.subject.none.fl_str_mv |
Matemática Leaf Compatible tree Clique tree Chordal Dually chordal |
| topic |
Matemática Leaf Compatible tree Clique tree Chordal Dually chordal |
| dc.description.none.fl_txt_mv |
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 |
| description |
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. |
| publishDate |
2009 |
| dc.date.none.fl_str_mv |
2009 |
| dc.type.none.fl_str_mv |
info:eu-repo/semantics/conferenceObject info:eu-repo/semantics/publishedVersion Objeto de conferencia http://purl.org/coar/resource_type/c_5794 info:ar-repo/semantics/documentoDeConferencia |
| format |
conferenceObject |
| status_str |
publishedVersion |
| dc.identifier.none.fl_str_mv |
http://sedici.unlp.edu.ar/handle/10915/93883 |
| url |
http://sedici.unlp.edu.ar/handle/10915/93883 |
| dc.language.none.fl_str_mv |
eng |
| language |
eng |
| dc.rights.none.fl_str_mv |
info:eu-repo/semantics/openAccess http://creativecommons.org/licenses/by-nc-sa/4.0/ Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0) |
| eu_rights_str_mv |
openAccess |
| rights_invalid_str_mv |
http://creativecommons.org/licenses/by-nc-sa/4.0/ Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0) |
| dc.format.none.fl_str_mv |
application/pdf 153-160 |
| dc.source.none.fl_str_mv |
reponame:SEDICI (UNLP) instname:Universidad Nacional de La Plata instacron:UNLP |
| reponame_str |
SEDICI (UNLP) |
| collection |
SEDICI (UNLP) |
| instname_str |
Universidad Nacional de La Plata |
| instacron_str |
UNLP |
| institution |
UNLP |
| repository.name.fl_str_mv |
SEDICI (UNLP) - Universidad Nacional de La Plata |
| repository.mail.fl_str_mv |
alira@sedici.unlp.edu.ar |
| _version_ |
1846064171249041408 |
| score |
13.22299 |