Finding intersection models: From chordal to Helly circular-arc graphs

Every chordal graph G admits a representation as the intersection graph of a family of subtrees of a tree. A classic way of finding such an intersection model is to look for a maximum spanning tree of the valuated clique graph of G. Similar techniques have been applied to find intersection models of...

Descripción completa

Guardado en:
Detalles Bibliográficos
Autores principales: Alcón, Liliana Graciela, Gutiérrez, Marisa
Formato: Articulo
Lenguaje:Inglés
Publicado: 2012
Materias:
Matemática
Chordal graphs
Clique-tree
Helly circular-arc graphs
Intersection models
Acceso en línea:http://sedici.unlp.edu.ar/handle/10915/84095
Aporte de:
SEDICI (UNLP) de Universidad Nacional de La Plata

Ejemplares similares

Ejemplares similares