Publisher： Elsevier
ISSN： 0304-3975
Source： Theoretical Computer Science, Vol.304, Iss.1, 2003-07, pp. : 237-247
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
Parallel local search for Steiner trees in graphs
By Verhoeven M.G.A. Severens M.E.M.
Annals of Operations Research, Vol. 90, Iss. 1, 1999-01 ,pp. :
Access to resources
Recommend
Scheduling UET-UCT series-parallel graphs on two processors
By Finta L. Zhen L. Milis I. Bampis E.
Theoretical Computer Science, Vol. 162, Iss. 2, 1996-08 ,pp. :
Maximum Series-Parallel Subgraph
By Călinescu Gruia Fernandes Cristina Kaul Hemanshu Zelikovsky Alexander
Algorithmica, Vol. 63, Iss. 1-2, 2012-06 ,pp. :
Series-parallel languages and the bounded-width property
Theoretical Computer Science, Vol. 237, Iss. 1, 2000-04 ,pp. :