PC trees and circular-ones arrangements.
type: Item
instance of: scholarly article
title: PC trees and circular-ones arrangements.
zbMATH Open document ID: 1044.68125
DOI: 10.1016/S0304-3975(02)00435-8
author: D. Massart
published in: Theoretical Computer Science
publication date: 2003-08-17T00:00:00Z
Mathematics Subject Classification ID: 68R10
zbMATH DE Number: 1965292
zbMATH Keywords: PQ trees
MaRDI profile type: Publication
cites work: Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
cites work: Introduction to algorithms
cites work: Decomposition of Directed Graphs
cites work: Q4492680
cites work: Theory of 2-structures. I: Clans, basic subclasses, and morphisms
cites work: Theory of 2-structures. II: Representation through labeled tree families
cites work: Incidence matrices and interval graphs
cites work: Transitiv orientierbare Graphen
cites work: Q4553234
cites work: A Simple Test for the Consecutive Ones Property
cites work: An efficient parallel algorithm for planarity
cites work: An Incremental Linear-Time Algorithm for Recognizing Interval Graphs
cites work: Q5596083
cites work: Q4829024
cites work: Q3683903
cites work: A new planarity test
full work available at URL: s0304-3975(02)00435-8
OpenAlex ID: W1971080253
description: scientific article; zbMATH DE number 1965292