Recognition and characterization of unit interval graphs with integer endpoints
We study those unit interval graphs having a model with intervals of integer endpoints and prescribed length. We present a structural result for this graph subclass which leads to a quadratic-time recognition algorithm, giving as positive certificate a model of minimum total length and as negative c...
| Autores: | , , , , |
|---|---|
| Formato: | artículo |
| Estado: | Versión publicada |
| Fecha de publicación: | 2017 |
| País: | Argentina |
| Recursos: | Consejo Nacional de Investigaciones Científicas y Técnicas |
| Repositorio: | CONICET Digital (CONICET) |
| Idioma: | inglés |
| OAI Identifier: | oai:ri.conicet.gov.ar:11336/50305 |
| Acesso em linha: | http://hdl.handle.net/11336/50305 |
| Access Level: | acceso abierto |
| Palavra-chave: | Forbidden Induced Subgraphs Proper Interval Graphs Unit Interval Graphs https://purl.org/becyt/ford/1.1 https://purl.org/becyt/ford/1 |
| Resumo: | We study those unit interval graphs having a model with intervals of integer endpoints and prescribed length. We present a structural result for this graph subclass which leads to a quadratic-time recognition algorithm, giving as positive certificate a model of minimum total length and as negative certificate a forbidden induced subgraph. We also present a quadratic-time algorithm to build, given a unit interval graph, a unit interval model with integer endpoints for which the interval length is as minimum as possible. |
|---|