Author:
Cirino K.,Muthukrishnan S.,Narayanaswamy N. S.,Ramesh H.
Publisher
Springer Berlin Heidelberg
Reference25 articles.
1. T. Andrae and M. Aigner. The total interval number of a graph. J. Comb. Theory, Series B, 46, 7–21, 1989.
2. F. Alizadeh, R.M. Karp, D.K. Weisser, G. Zweig, Physical Mapping of Chromosomes Using Unique Probes, J. Comp. Bio., 2(2):153–158, 1995.
3. S. Arnborg, A. Proskurowski, Linear Time Algorithms for NP-Hard Problems Restricted to Partial k-Trees, Discrete Applied Mathematics, 23:11–24, 1989.
4. H. Bodlaender. A tourist guide through treewidth. Manuscript, 1995.
5. H. Bodlaender, M. Fellows, M. Hallet, T. Wareham and T. Warnow. The hardness of problems on thin colored graphs. Manuscript, 1995.
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献