A fast parallel algorithm to recognize P4-sparse graphs
type: Item
instance of: scholarly article
title: A fast parallel algorithm to recognize P4-sparse graphs
zbMATH Open document ID: 0894.68110
DOI: 10.1016/S0166-218X(97)00085-1
author: Rong Lin
author: Stephan Olariu
published in: Discrete Applied Mathematics
publication date: 1998-08-19T00:00:00Z
full work available at URL: dam
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 68W10
zbMATH DE Number: 1133161
zbMATH Keywords: mobile computing
zbMATH Keywords: group-based collaboration
zbMATH Keywords: automated theorem proving
zbMATH Keywords: networking
zbMATH Keywords: scheduling
zbMATH Keywords: cluster analysis
MaRDI profile type: Publication
cites work: The Isomorphism Problem For Directed Path Graphs and For Rooted Directed Path Graphs
cites work: Q5422499
cites work: A Linear Time Algorithm for Deciding Interval Graph Isomorphism
cites work: Q3697033
cites work: Complement reducible graphs
cites work: A Linear Recognition Algorithm for Cographs
cites work: Efficient parallel recognition algorithms of cographs and distance hereditary graphs
cites work: Parallel Algorithm for Cograph Recognition with Applications
cites work: Q4013534
cites work: Hamiltonicity in graphs with few \(P_ 4\)'s
cites work: P4-Reducible Graphs-Class of Uniquely Tree-Representable Graphs
cites work: A tree representation for \(P_ 4\)-sparse graphs
cites work: Recognizing $P_4 $-Sparse Graphs in Linear Time
cites work: A linear-time recognition algorithm for \(P_{4}\)-reducible graphs
cites work: P-Components and the Homogeneous Decomposition of Graphs
cites work: Linear time optimization algorithms for \(P_ 4\)-sparse graphs
cites work: On a class of posets and the corresponding comparability graphs
cites work: Isomorphism Testing in Hookup Classes
cites work: Q4130999
cites work: An optimal parallel matching algorithm for cographs
cites work: On a property of the class of n-colorable graphs
cites work: Dacey Graphs
cites work: Q4857805
Wikidata QID: Q127797600
description: scientific article; zbMATH DE number 1133161