Restrictions of graph partition problems. Part I
- 1 August 1995
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 148 (1) , 93-109
- https://doi.org/10.1016/0304-3975(95)00057-4
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- Processor optimization for flow graphsTheoretical Computer Science, 1992
- A Linear Recognition Algorithm for CographsSIAM Journal on Computing, 1985
- The NP-completeness column: an ongoing guideJournal of Algorithms, 1985
- Efficient algorithms for interval graphs and circular‐arc graphsNetworks, 1982
- Scheduling Interval-Ordered TasksSIAM Journal on Computing, 1979
- On a property of the class of n-colorable graphsJournal of Combinatorial Theory, Series B, 1974