Author： Farzan Arash Kamali Shahin
Publisher： Springer Publishing Company
ISSN： 0178-4617
Source： Algorithmica, Vol.69, Iss.1, 2014-05, pp. : 92-116
Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.
Related content
A partial k-arboretum of graphs with bounded treewidth
Theoretical Computer Science, Vol. 209, Iss. 1, 1998-12 ,pp. :
Access to resources
Recommend
On treewidth and minimum fill-in of asteroidal triple-free graphs
By Kloks T. Kratsch D. Spinrad J.
Theoretical Computer Science, Vol. 175, Iss. 2, 1997-04 ,pp. :
Learning View Graphs for Robot Navigation
By Franz M.O. Schölkopf B. Mallot H.A. Bülthoff H.H.
Autonomous Robots, Vol. 5, Iss. 1, 1998-03 ,pp. :