Cover-preserving embeddings of bipartite orders into Boolean lattices

Author： Mitas J.   Reuter K.  

Publisher： Elsevier

ISSN： 0304-3975

Source： Theoretical Computer Science, Vol.175, Iss.2, 1997-04, pp. : 337-347

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

Abstract

Related content

Applying relation algebra and RelView to solve problems on orders and lattices

By Berghammer Rudolf  

Acta Informatica, Vol. 45, Iss. 3, 2008-05 ,pp. : 211-236

Springer Publishing Company

Access to resources Recommend Favorite

Constrained minimum vertex cover in bipartite graphs: complexity and parameterized algorithms

By Chen J.   Kanj I.A.  

Journal of Computer and System Sciences, Vol. 67, Iss. 4, 2003-12 ,pp. : 833-847

Elsevier

Access to resources Recommend Favorite

On boolean lowness and boolean highness

By Reith S.   Wagner K.W.  

Theoretical Computer Science, Vol. 261, Iss. 2, 2001-06 ,pp. : 305-321

Elsevier

Access to resources Recommend Favorite

Characterizing bipartite Toeplitz graphs

By Euler R.  

Theoretical Computer Science, Vol. 263, Iss. 1, 2001-07 ,pp. : 47-58

Elsevier

Access to resources Recommend Favorite

Algorithmic graph embeddings

By Chen J.  

Theoretical Computer Science, Vol. 181, Iss. 2, 1997-07 ,pp. : 247-266

Elsevier

Access to resources Recommend Favorite