Author:
Chen Guantao,Ehrenmüller Julia,Fernandes Cristina G.,Heise Carl Georg,Shan Songling,Yang Ping,Yates Amy N.
Subject
Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference33 articles.
1. Linear time algorithms for NP-hard problems restricted to partial k-trees;Arnborg;Discrete Appl. Math.,1989
2. When do three longest paths have a common vertex?;Axenovich;Discrete Math. Algorithms Appl.,2009
3. Longest paths in circular arc graphs;Balister;Combin. Probab. Comput.,2004
4. Dynamic programming on graphs with bounded treewidth;Bodlaender,1988
5. On linear time minor tests with depth-first search;Bodlaender;J. Algorithms,1993
Cited by
20 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献