| Article ID: | iaor1996605 |
| Country: | United States |
| Volume: | 30 |
| Issue: | 8 |
| Start Page Number: | 75 |
| End Page Number: | 83 |
| Publication Date: | Oct 1995 |
| Journal: | Computers & Mathematics with Applications |
| Authors: | Olariu S., Lin R., Pruesse G. |
| Keywords: | scheduling, graphs |
The class of cographs, or complement-reducible graphs, arises naturally in many different areas of applied mathematics and computer science. In this paper, the authors present an optimal algorithm for determining a minimum path cover for a cograph