Document Type

Article

Publication Date

1995

DOI

10.1016/0898-1221(95)00139-p

Publication Title

Computers & Mathematics with Applications

Volume

30

Issue

8

Pages

75-83

Abstract

The class of cographs, or complement-reducible graphs, arises naturally in many different areas of applied mathematics and computer science. In this paper, we present an optimal algorithm for determining a minimum path cover for a cograph G. In case G has a Hamiltonian path (cycle) our algorithm exhibits the path (cycle) as well.

Comments

Elsevier open archive. Copyright © 1995 Published by Elsevier Ltd. All rights reserved.

Original Publication Citation

Lin, R., Olariu, S., & Pruesse, G. (1995). An optimal path cover algorithm for cographs. Computers & Mathematics with Applications, 30(8), 75-83. doi:10.1016/0898-1221(95)00139-p

ORCID

0000-0002-3776-216X (Olariu)

Download

Share

COinS