Author： Rapaport I. Suchan K. Todinca I. Verstraete J.
Publisher： Springer Publishing Company
ISSN： 0178-4617
Source： Algorithmica, Vol.59, Iss.1, 2011-01, pp. : 16-34
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
Connectionist learning of regular graph grammars
Connection Science, Vol. 13, Iss. 2, 2001-06 ,pp. :
Access to resources
Recommend
Regular Description of Context-free Graph Languages
By Engelfriet J. van Oostrom V.
Journal of Computer and System Sciences, Vol. 53, Iss. 3, 1996-12 ,pp. :
Classes of submodular constraints expressible by graph cuts
By Živný Stanislav Jeavons Peter
Constraints, Vol. 15, Iss. 3, 2010-07 ,pp. :
On algebraic and logical specifications of classes of regular languages
Theoretical Computer Science, Vol. 298, Iss. 2, 2003-04 ,pp. :