Decomposing a set of points into chains, with applications to permutation and circle graphs
- 18 November 1985
- journal article
- Published by Elsevier in Information Processing Letters
- Vol. 21 (5) , 249-252
- https://doi.org/10.1016/0020-0190(85)90093-6
Abstract
No abstract availableThis publication has 5 references indexed in Scilit:
- Approximation algorithms for combinatorial problemsPublished by Elsevier ,2007
- On Comparability and Permutation GraphsSIAM Journal on Computing, 1985
- Improving the performance guarantee for approximate graph coloringJournal of the ACM, 1983
- Permutation Graphs and Transitive GraphsJournal of the ACM, 1972
- A Decomposition Theorem for Partially Ordered SetsAnnals of Mathematics, 1950