Flavia Bonomo, Fabiano Oliveira, Moysés S. Sampaio, Jayme Szwarcfiter
{"title":"Reconhecimento de Grafos Fino de Precedência","authors":"Flavia Bonomo, Fabiano Oliveira, Moysés S. Sampaio, Jayme Szwarcfiter","doi":"10.5753/etc.2019.6396","DOIUrl":null,"url":null,"abstract":"The class of k-thin graphs have recently been introduced generalizing interval graphs. The complexity of the recognition of k-thin is open, even for fixed k 1. We introduce a subclass of the k-thin graphs, called precedence k-thin graphs, presenting an efficient recognition algorithm based on PQ trees.","PeriodicalId":315906,"journal":{"name":"Anais do Encontro de Teoria da Computação (ETC)","volume":"333 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-07-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Anais do Encontro de Teoria da Computação (ETC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.5753/etc.2019.6396","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1
Abstract
The class of k-thin graphs have recently been introduced generalizing interval graphs. The complexity of the recognition of k-thin is open, even for fixed k 1. We introduce a subclass of the k-thin graphs, called precedence k-thin graphs, presenting an efficient recognition algorithm based on PQ trees.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
