Author： M.S. Paterson Teng S.-H.
Publisher： Elsevier
ISSN： 0304-3975
Source： Theoretical Computer Science, Vol.145, Iss.1, 1995-07, pp. : 381-390
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
Access to resources
Recommend
Handsome proof-nets: perfect matchings and cographs
By Retore C.
Theoretical Computer Science, Vol. 294, Iss. 3, 2003-02 ,pp. :
Combinatorics of perfect matchings in plane bipartite graphs and application to tilings
Theoretical Computer Science, Vol. 303, Iss. 2, 2003-07 ,pp. :
By Halldorsson M.M. Iwama K. Miyazaki S. Taketomi S.
Theoretical Computer Science, Vol. 289, Iss. 2, 2002-10 ,pp. :
On Independent Sets and Bicliques in Graphs
By Gaspers Serge Kratsch Dieter Liedloff Mathieu
Algorithmica, Vol. 62, Iss. 3-4, 2012-04 ,pp. :