Matching preclusion and conditional matching preclusion for pancake and burnt pancake graphs

Author： Cheng Eddie   Hu Philip   Jia Roger   Lipták László   Scholten Brian   Voss James  

Publisher： Taylor & Francis Ltd

ISSN： 1744-5760

Source： International Journal of Parallel, Emergent and Distributed Systems, Vol.29, Iss.5, 2014-09, pp. : 499-512

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Related content

An online composite graphics recognition approach based on matching of spatial relation graphs

By Xiaogang Xu  

International Journal on Document Analysis and Recognition (IJDAR), Vol. 7, Iss. 1, 2004-03 ,pp. : 44-55

Springer Publishing Company

Access to resources Recommend Favorite

Structuring the elementary components of graphs having a perfect internal matching

By Bartha M.   Kresz M.  

Theoretical Computer Science, Vol. 299, Iss. 1, 2003-04 ,pp. : 179-210

Elsevier

Access to resources Recommend Favorite

An Efficient Parallel Algorithm for Maximum Matching for Some Classes of Graphs

By Parfenoff I.  

Journal of Parallel and Distributed Computing, Vol. 52, Iss. 1, 1998-07 ,pp. : 96-108

Academic Press

Access to resources Recommend Favorite

OWL schema matching

By Leme Luiz  

Journal of the Brazilian Computer Society, Vol. 16, Iss. 1, 2010-05 ,pp. : 21-34

Springer Publishing Company

Access to resources Recommend Favorite

Matching the assembly robot to the factory

By Gaudio I. Del   Maio F. Di   Lamonaca E.  

Assembly Automation, Vol. 1, Iss. 1, 1993-12 ,pp. : 26-29

Emerald Group Publishing Ltd

Access to resources Recommend Favorite