Skip to Main content Skip to Navigation
Reports

Cover-Preserving Embeddings of Bipartite Orders into Boolean Lattices

Jutta Mitas 1 Klaus Reuter 2
1 PAMPA - Models and Tools for Programming Distributed Parallel Architectures
IRISA - Institut de Recherche en Informatique et Systèmes Aléatoires, INRIA Rennes
Abstract : We study the question which bipartite ordered sets are order preserving embeddable into two consecutive levels of a Boolean lattice. This is related to investigations on parallel computer architectures, where bipartite networks are embedded into hypercube networks. In our main Theorem we characterize these orders by the existence of a suited edge-coloring of the covering graph. We analyze the representations of cycle-free orders, crowns and glued crowns and present an infinite family of orders which are not embeddable. Their construction shows that this embeddability is not characterizable by a finite number of forbidden suborders.
Document type :
Reports
Complete list of metadata

https://hal.inria.fr/inria-00074166
Contributor : Rapport de Recherche Inria <>
Submitted on : Wednesday, May 24, 2006 - 2:39:23 PM
Last modification on : Thursday, February 11, 2021 - 2:48:05 PM
Long-term archiving on: : Monday, April 5, 2010 - 12:06:14 AM

Identifiers

  • HAL Id : inria-00074166, version 1

Citation

Jutta Mitas, Klaus Reuter. Cover-Preserving Embeddings of Bipartite Orders into Boolean Lattices. [Research Report] RR-2512, INRIA. 1995. ⟨inria-00074166⟩

Share

Metrics

Record views

224

Files downloads

505