Publisher： Elsevier
ISSN： 0304-3975
Source： Theoretical Computer Science, Vol.237, Iss.1, 2000-04, pp. : 347-380
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
Query learning of bounded-width OBDDs
By Nakamura A.
Theoretical Computer Science, Vol. 241, Iss. 1, 2000-06 ,pp. :
Access to resources
Recommend
Maximum Series-Parallel Subgraph
By Călinescu Gruia Fernandes Cristina Kaul Hemanshu Zelikovsky Alexander
Algorithmica, Vol. 63, Iss. 1-2, 2012-06 ,pp. :
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. :
A PTAS for weight constrained Steiner trees in series-parallel graphs
Theoretical Computer Science, Vol. 304, Iss. 1, 2003-07 ,pp. :