A time-optimal solution for the path cover problem on cographs.
type: Item
instance of: scholarly article
title: A time-optimal solution for the path cover problem on cographs.
zbMATH Open document ID: 1038.68087
DOI: 10.1016/S0304-3975(02)00068-3
author: Koji Nakano
author: Stephan Olariu
author: Albert Y. Zomaya
published in: Theoretical Computer Science
publication date: 2003-08-17T00:00:00Z
Mathematics Subject Classification ID: 68R10
zbMATH DE Number: 1965223
zbMATH Keywords: vertex cograph
MaRDI profile type: Publication
cites work: A simple parallel tree contraction algorithm
cites work: Deterministic parallel list ranking
cites work: Q5422499
cites work: Approximate Parallel Scheduling. Part I: The Basic Technique with Applications to Optimal Parallel List Ranking in Logarithmic Time
cites work: Upper and Lower Time Bounds for Parallel Random Access Machines without Simultaneous Writes
cites work: Complement reducible graphs
cites work: Q4198056
cites work: Optimal parallel algorithms for dynamic expression evaluation and context-free recognition
cites work: Parallel Algorithm for Cograph Recognition with Applications
cites work: Q4023519
cites work: Q4385522
cites work: Efficient parallel algorithms for graph problems
cites work: An optimal path cover algorithm for cographs
cites work: AN EFFICIENT EREW ALGORITHM FOR MINIMUM PATH COVER AND HAMILTONICITY ON COGRAPHS
cites work: An Efficient Parallel Biconnectivity Algorithm
full work available at URL: s0304-3975(02)00068-3
OpenAlex ID: W2028704451
description: scientific article; zbMATH DE number 1965223