Author： Fukuda K. Prodon A. Sakuma T.
Publisher： Elsevier
ISSN： 0304-3975
Source： Theoretical Computer Science, Vol.263, Iss.1, 2001-07, pp. : 9-16
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
A multi-tree routing scheme using acyclic orientations
By Annexstein
Theoretical Computer Science, Vol. 240, Iss. 2, 2000-06 ,pp. :
Access to resources
Recommend
A shrinking lemma for indexed languages
By Gilman R.H.
Theoretical Computer Science, Vol. 163, Iss. 1, 1996-08 ,pp. :
A syntactical proof of the Marriage Lemma
By Coquand T.
Theoretical Computer Science, Vol. 290, Iss. 1, 2003-01 ,pp. :
Asymptotic Enumeration of Extensional Acyclic Digraphs
Algorithmica, Vol. 66, Iss. 4, 2013-08 ,pp. :
Efficient algorithms for acyclic colorings of graphs
By Chen Z.-Z.
Theoretical Computer Science, Vol. 230, Iss. 1, 2000-01 ,pp. :