Author： Brandstadt Andreas Dragan Feodor F. Le Hoang-Oanh Le Van Bang Uehara Ryuhei
Publisher： Springer Publishing Company
ISSN： 0178-4617
Source： Algorithmica, Vol.47, Iss.1, 2007-01, pp. : 27-51
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
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. :
Access to resources
Recommend
Characterizing bipartite Toeplitz graphs
By Euler R.
Theoretical Computer Science, Vol. 263, Iss. 1, 2001-07 ,pp. :
Edge coloring of bipartite graphs with constraints
By Caragiannis I. Kaklamanis C. Persiano P.
Theoretical Computer Science, Vol. 270, Iss. 1, 2002-01 ,pp. :