Author： Guo Jiong Niedermeier Rolf Raible Daniel
Publisher： Springer Publishing Company
ISSN： 0178-4617
Source： Algorithmica, Vol.52, Iss.2, 2008-10, pp. : 177-202
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
Hardness results and approximation algorithms of k-tuple domination in graphs
Information Processing Letters, Vol. 89, Iss. 2, 2004-01 ,pp. :
Access to resources
Recommend
Tree spanners on chordal graphs: complexity and algorithms
By Brandstadt A. Dragan F.F. Le H.-O. Le V.B.
Theoretical Computer Science, Vol. 310, Iss. 1, 2004-01 ,pp. :
Improved shortest path algorithms for nearly acyclic graphs
Theoretical Computer Science, Vol. 293, Iss. 3, 2003-02 ,pp. :