Author： Kloks T. Kratsch D. Spinrad J.
Publisher： Elsevier
ISSN： 0304-3975
Source： Theoretical Computer Science, Vol.175, Iss.2, 1997-04, pp. : 309-335
Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.
Abstract
Related content
Compact Navigation and Distance Oracles for Graphs with Small Treewidth
Algorithmica, Vol. 69, Iss. 1, 2014-05 ,pp. :
Access to resources
Recommend
A partial k-arboretum of graphs with bounded treewidth
Theoretical Computer Science, Vol. 209, Iss. 1, 1998-12 ,pp. :
Minimum Cycle Bases for Network Graphs
By Berger Franziska Gritzmann Peter Vries Sven
Algorithmica, Vol. 40, Iss. 1, 2004-06 ,pp. :