AN EFFICIENT EREW ALGORITHM FOR MINIMUM PATH COVER AND HAMILTONICITY ON COGRAPHS

DOI10.1080/10637199408915409MaRDI QIDQ4819984zbMATH OpenOpenAlexFDO

Authors Rong Lin, Stephan Olariu, James L. Schwing, Jingyuan Zhang

Publication date 6 October 2004

Published in Parallel Algorithms and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/10637199408915409

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Parallel algorithms in computer science (68W10)

Cites work

• scientific article; zbMATH DE number 176748 (Why is no real title available?)
• A simple parallel tree contraction algorithm
• An Efficient Parallel Biconnectivity Algorithm
• Approximate Parallel Scheduling. Part I: The Basic Technique with Applications to Optimal Parallel List Ranking in Logarithmic Time
• Complement reducible graphs
• Deterministic parallel list ranking
• Efficient parallel algorithms for graph problems
• Graph theory with applications
• Optimal parallel algorithms for dynamic expression evaluation and context-free recognition
• Parallel Tree Contraction Part 2: Further Applications
• The accelerated centroid decomposition technique for optimal parallel tree evaluation in logarithmic time

Cited in

(4)

• A time-optimal solution for the path cover problem on cographs.
• An efficient algorithm to construct disjoint path covers of DCell networks
• Hamiltonicity in graphs with few \(P_ 4\)'s
• An optimal path cover algorithm for cographs

This page was built for publication: AN EFFICIENT EREW ALGORITHM FOR MINIMUM PATH COVER AND HAMILTONICITY ON COGRAPHS

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4819984)