| Article ID: | iaor20001712 |
| Country: | Netherlands |
| Volume: | 91 |
| Issue: | 1/3 |
| Start Page Number: | 287 |
| End Page Number: | 292 |
| Publication Date: | Jan 1999 |
| Journal: | Discrete Applied Mathematics |
| Authors: | Borie Richard B., Spinrad Jeremy P. |
We describe a linear-time algorithm to build a simple elimination scheme for a chordal comparability graph. This leads to a linear-time algorithm for the maximum matching problem on chordal comparability graphs.