Author:
Clautiaux François,Carlier Jacques,Moukrim Aziz,Nègre Stéphane
Publisher
Springer Berlin Heidelberg
Reference18 articles.
1. The second dimacs implementation challenge: NP-hard problems: Maximum clique, graph coloring, and satisfiability, 1992–1993.
2. S. Arnborg and A. Proskurowki, Characterisation and recognition of partial 3-trees, SIAM J. Alg. Disc. Meth. 7 (1986), 305–314.
3. H. Bodlaender, A linear time algorithm for finding tree-decompositions of small treewidth, SIAM J. Comput. 25 (1996), 1305–1317.
4. —, Necessary edges in k-chordalisation of graphs, Tech. Report UU-CS-2000-27, Institute for Information and Computing Sciences, Utrecht University, 2000.
5. H. Bodlaender and R. Möhring, The pathwidth and treewidth of cographs, SIAM J. Disc. Math. 6 (1993), 181–188.
Cited by
21 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献