Linear time optimization algorithms for \(P_ 4\)-sparse graphs
type: Item
instance of: scholarly article
title: Linear time optimization algorithms for \(P_ 4\)-sparse graphs
zbMATH Open document ID: 0831.68075
DOI: 10.1016/0166-218X(94)00012-3
author: Beverly Jamison
author: Stephan Olariu
published in: Discrete Applied Mathematics
publication date: 1996-02-06T00:00:00Z
Mathematics Subject Classification ID: 68R10
zbMATH DE Number: 790497
zbMATH Keywords: NP-hard problems
MaRDI profile type: Publication
cites work: Q5422499
cites work: Complement reducible graphs
cites work: A Linear Recognition Algorithm for Cographs
cites work: Q4198056
cites work: The edge inducibility of graphs
cites work: Q4013534
cites work: P4-Reducible Graphs-Class of Uniquely Tree-Representable Graphs
cites work: Recognizing $P_4 $-Sparse Graphs in Linear Time
cites work: A tree representation for \(P_ 4\)-sparse graphs
cites work: On a class of posets and the corresponding comparability graphs
cites work: Weak bipolarizable graphs
cites work: Computing the Minimum Fill-In is NP-Complete
full work available at URL: 0166-218x(94)00012-3
OpenAlex ID: W59383121
Wikidata QID: Q126459170
description: scientific article; zbMATH DE number 790497