![Open Access](https://i-scholar.in/lib/pkp/templates/images/icons/fulltextgreen.png)
![Restricted Access](https://i-scholar.in/lib/pkp/templates/images/icons/fulltextred.png)
![Open Access](https://i-scholar.in/lib/pkp/templates/images/icons/fulltextgreen.png)
![Open Access](https://i-scholar.in/lib/pkp/templates/images/icons/fulltext_open_medium.gif)
![Restricted Access](https://i-scholar.in/lib/pkp/templates/images/icons/fulltextred.png)
![Restricted Access](https://i-scholar.in/lib/pkp/templates/images/icons/fulltext_restricted_medium.gif)
Chordal Graphs with Specified Perfect Elimination Orderings
Subscribe/Renew Journal
In this paper we characterize chordal graphs in which:
(i) Every perfect elimination ordering (PEO) can be generated by MCS algorithm.
(ii) Every PEO can be generated by LEX-BFS algorithm,
(iii) Every PEO can be generated by MCS algorithm as well as LEX-BFS algorithm, and
(iv) Every ordering generated by LEX-BFS algorithm can also be generated by MCS algorithm and vice versa.
User
Subscription
Login to verify subscription
Font Size
Information
![](https://i-scholar.in/public/site/images/abstractview.png)
Abstract Views: 180
![](https://i-scholar.in/public/site/images/pdfview.png)
PDF Views: 0