Opening book details…
Can I read Dense Sets and Embedding Binary Trees Into Hypercubes on EtoBox?
Dense Sets and Embedding Binary Trees Into Hypercubes by Tomáš Dvořák is a Computer Science article available to read on EtoBox.
What is Dense Sets and Embedding Binary Trees Into Hypercubes about?
The purpose of this paper is to describe a method for embedding binary trees into hypercubes based on an iterative embedding into their subgraphs induced by dense sets. As a particular application, we present a class of binary trees, defined in terms of size of their subtrees, whose members allow a dilation two embedding into their optimal hypercubes. This provides a partial evidence in favor of a long-standing conjecture of Bhatt and Ipsen which claims that such an embedding exists for an arbitrary binary tree.
Who reads Dense Sets and Embedding Binary Trees Into Hypercubes?
It is typically read by researchers, students, and practitioners in Computer Science.
- Author
- Tomáš Dvořák
- Publisher
- Elsevier Science; Elsevier ; Elsevier BV (ISSN 0166-218X)
- Published
- 2007
- Language
- EN
- Field
- Computer Science (Physical Sciences)