An optimal parallel solution for the path cover problem on -sparse graphs-Reference-Cited by-同舟云学术

An optimal parallel solution for the path cover problem on -sparse graphs

Published:2007-01 Issue:1 Volume:67 Page:63-76
ISSN:0743-7315
Container-title:Journal of Parallel and Distributed Computing
language:en
Short-container-title:Journal of Parallel and Distributed Computing

Author:

Asdre Katerina,Nikolopoulos Stavros D.,Papadopoulos Charis

Publisher

Elsevier BV

Subject

Artificial Intelligence,Computer Networks and Communications,Hardware and Architecture,Theoretical Computer Science,Software

Reference23 articles.

1. A simple parallel tree contraction algorithm;Abrahamson;J. Algorithms,1989

2. G.S. Adhar, S. Peng, Parallel algorithm for path covering, Hamiltonian path, and Hamiltonian cycle in cographs, in: International Conference on Parallel Processing, vol. III, 1990, pp. 364–365.

3. K. Asdre, S.D. Nikolopoulos, Ch. Papadopoulos, Optimal algorithms for the path cover problem on P4-sparse graphs, in: Workshop on Graphs and Combinatorial Optimization (CTW’05), vol. 1, 2005, pp. 79–83.

4. Graph Classes—A Survey, SIAM Monographs in Discrete Mathematics and Applications;Brandstädt,1999

5. A linear recognition algorithm for cographs;Corneil;SIAM J. Comput.,1985

Cited by 6 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. A 5k-vertex kernel for 3-path vertex cover;Theoretical Computer Science;2023-05

2. Exact algorithms for the maximum dissociation set and minimum 3-path vertex cover problems;Theoretical Computer Science;2017-01

3. Kernelization and Parameterized Algorithms for 3-Path Vertex Cover;Lecture Notes in Computer Science;2017

4. Faster Computation of the Maximum Dissociation Set and Minimum 3-Path Vertex Cover in Graphs;Frontiers in Algorithmics;2015

5. Cograph Editing: Complexity and Parameterized Algorithms;Lecture Notes in Computer Science;2011