Publisher
Springer Berlin Heidelberg
Reference11 articles.
1. Arnborg, S.: Efficient algorithms for combinatorial problems on graphs with bounded decomposability — a survey. BIT 25 (1985) 2–23
2. Bodlaender, H.L.: A linear time algorithm for finding tree-decompositions of small treewidth. 25.th ACM Symposium on the Theory of Computing (1993) 226–234
3. Bodlaender, H.L., Jansen, K., Woeginger, G.: Scheduling with incompatible jobs. Graph Theoretic Concepts in Computer Science, LNCS 657 (1992) 37–49
4. Chvatal, V.: On certain polytopes associated with graphs. Journal Combinatorial Theory B-18 (1975) 138–154
5. Hujter, M., Tuza, Z.: Precoloring extension. III. Classes of perfect graphs. Combinatorics, Probability and Computing 5 (1996) 35–56
Cited by
16 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献