A simple linear time certifying LBFS-based algorithm for recognizing trivially perfect graphs and their complements
type: Item
instance of: scholarly article
title: A simple linear time certifying LBFS-based algorithm for recognizing trivially perfect graphs and their complements
zbMATH Open document ID: 1185.05134
author: Frank Pok Man Chu
published in: Information Processing Letters
publication date: 2010-04-19T00:00:00Z
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 05C17
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 68W05
zbMATH DE Number: 5694945
zbMATH Keywords: algorithms
zbMATH Keywords: combinatorial problems
zbMATH Keywords: graph algorithms
zbMATH Keywords: recognizing trivially perfect graphs
zbMATH Keywords: lexicographic BFS
zbMATH Keywords: LBFS
zbMATH Keywords: lexicographic breadth first search
MaRDI profile type: Publication
full work available at URL: j.ipl.2007.12.009
OpenAlex ID: W2089241552
cites work: Graph-Theoretic Concepts in Computer Science
cites work: Trivially perfect graphs
cites work: Lex-BFS and partition refinement, with applications to transitive orientation, interval graph recognition and consecutive ones testing
cites work: Q3203054
cites work: Q4161356
cites work: The Comparability Graph of a Tree
cites work: Quasi-threshold graphs
DOI: 10.1016/J.IPL.2007.12.009
description: scientific article; zbMATH DE number 5694945