Author:
Chang Lijun,Yu Jeffrey Xu,Qin Lu,Cheng Hong,Qiao Miao
Publisher
Springer Science and Business Media LLC
Subject
Hardware and Architecture,Information Systems
Reference32 articles.
1. Arnborg S., Corneil D.G., Proskurowski A.: Complexity of finding embeddings in a k-tree. SIAM J. Algebraic Discret Methods 8(2), 277–284 (1987)
2. Barabasi A.-L., Albert R.: Emergence of scaling in random networks. Science. 286, 509–512 (1999)
3. Baswana S., Sen S.: Approximate distance oracles for unweighted graphs in expected o(n2) time. ACM Trans. Algorithms 2(4), 557–577 (2006)
4. Bodlaender H.L., Koster A.M.C.A: Treewidth computations I. Upper bounds. Inf. Comput. 208(3), 259–275 (2010)
5. Chaudhuri S., Zaroliagis C.D.: Shortest paths in digraphs of small treewidth. Part I: Sequential algorithms. Algorithmica. 27(3), 212–226 (2000)
Cited by
47 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献