How to embed trees in hypercubes:
Discusses efficient embedding of a complete binary tree in the hypercube. Cf. Abstract.
Gespeichert in:
| Hauptverfasser: | , |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
New Haven, Connecticut
1985
|
| Schriftenreihe: | Yale University <New Haven, Conn.> / Department of Computer Science: Research report
443 |
| Zusammenfassung: | Discusses efficient embedding of a complete binary tree in the hypercube. Cf. Abstract. |
| Beschreibung: | 8 S. |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV035582173 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | t | ||
| 008 | 090624s1985 |||| 00||| engod | ||
| 035 | |a (OCoLC)13639984 | ||
| 035 | |a (DE-599)BVBBV035582173 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-91G | ||
| 100 | 1 | |a Bhatt, Sandeep Nautam |e Verfasser |0 (DE-588)122358848 |4 aut | |
| 245 | 1 | 0 | |a How to embed trees in hypercubes |
| 264 | 1 | |a New Haven, Connecticut |c 1985 | |
| 300 | |a 8 S. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a Yale University <New Haven, Conn.> / Department of Computer Science: Research report |v 443 | |
| 520 | 3 | |a Discusses efficient embedding of a complete binary tree in the hypercube. Cf. Abstract. | |
| 700 | 1 | |a Ipsen, Ilse C. F. |e Verfasser |0 (DE-588)137389973 |4 aut | |
| 810 | 2 | |a Department of Computer Science: Research report |t Yale University <New Haven, Conn.> |v 443 |w (DE-604)BV006663362 |9 443 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-017637566 | ||
Datensatz im Suchindex
| _version_ | 1804139240775221248 |
|---|---|
| any_adam_object | |
| author | Bhatt, Sandeep Nautam Ipsen, Ilse C. F. |
| author_GND | (DE-588)122358848 (DE-588)137389973 |
| author_facet | Bhatt, Sandeep Nautam Ipsen, Ilse C. F. |
| author_role | aut aut |
| author_sort | Bhatt, Sandeep Nautam |
| author_variant | s n b sn snb i c f i icf icfi |
| building | Verbundindex |
| bvnumber | BV035582173 |
| ctrlnum | (OCoLC)13639984 (DE-599)BVBBV035582173 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01057nam a2200289 cb4500</leader><controlfield tag="001">BV035582173</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">090624s1985 |||| 00||| engod</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)13639984</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV035582173</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rakddb</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-91G</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Bhatt, Sandeep Nautam</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)122358848</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">How to embed trees in hypercubes</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">New Haven, Connecticut</subfield><subfield code="c">1985</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">8 S.</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="490" ind1="1" ind2=" "><subfield code="a">Yale University <New Haven, Conn.> / Department of Computer Science: Research report</subfield><subfield code="v">443</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Discusses efficient embedding of a complete binary tree in the hypercube. Cf. Abstract.</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Ipsen, Ilse C. F.</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)137389973</subfield><subfield code="4">aut</subfield></datafield><datafield tag="810" ind1="2" ind2=" "><subfield code="a">Department of Computer Science: Research report</subfield><subfield code="t">Yale University <New Haven, Conn.></subfield><subfield code="v">443</subfield><subfield code="w">(DE-604)BV006663362</subfield><subfield code="9">443</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-017637566</subfield></datafield></record></collection> |
| id | DE-604.BV035582173 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T21:40:57Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-017637566 |
| oclc_num | 13639984 |
| open_access_boolean | |
| owner | DE-91G DE-BY-TUM |
| owner_facet | DE-91G DE-BY-TUM |
| physical | 8 S. |
| publishDate | 1985 |
| publishDateSearch | 1985 |
| publishDateSort | 1985 |
| record_format | marc |
| series2 | Yale University <New Haven, Conn.> / Department of Computer Science: Research report |
| spelling | Bhatt, Sandeep Nautam Verfasser (DE-588)122358848 aut How to embed trees in hypercubes New Haven, Connecticut 1985 8 S. txt rdacontent n rdamedia nc rdacarrier Yale University <New Haven, Conn.> / Department of Computer Science: Research report 443 Discusses efficient embedding of a complete binary tree in the hypercube. Cf. Abstract. Ipsen, Ilse C. F. Verfasser (DE-588)137389973 aut Department of Computer Science: Research report Yale University <New Haven, Conn.> 443 (DE-604)BV006663362 443 |
| spellingShingle | Bhatt, Sandeep Nautam Ipsen, Ilse C. F. How to embed trees in hypercubes |
| title | How to embed trees in hypercubes |
| title_auth | How to embed trees in hypercubes |
| title_exact_search | How to embed trees in hypercubes |
| title_full | How to embed trees in hypercubes |
| title_fullStr | How to embed trees in hypercubes |
| title_full_unstemmed | How to embed trees in hypercubes |
| title_short | How to embed trees in hypercubes |
| title_sort | how to embed trees in hypercubes |
| volume_link | (DE-604)BV006663362 |
| work_keys_str_mv | AT bhattsandeepnautam howtoembedtreesinhypercubes AT ipsenilsecf howtoembedtreesinhypercubes |