Title of article
An optimal path cover algorithm for cographs
Author/Authors
R. Lin، نويسنده , , S. Olariu، نويسنده , , G. Pruesse، نويسنده ,
Issue Information
دوهفته نامه با شماره پیاپی سال 1995
Pages
9
From page
75
To page
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.
Keywords
Optimal algorithms , Greedy algorithms , Cographs , Scheduling , Path cover , Hamiltonicity , VLSI
Journal title
Computers and Mathematics with Applications
Serial Year
1995
Journal title
Computers and Mathematics with Applications
Record number
917619
Link To Document