On a proposed divide-and-conquer minimal spanning tree algorithm:
Gespeichert in:
| Beteiligte Personen: | , |
|---|---|
| Format: | Buch |
| Sprache: | Nichtbestimmte Sprache |
| Veröffentlicht: |
Pullman, Wash.
1988
|
| Schriftenreihe: | Washington State University <Pullman, Wash.> / Computer Science Department: CS
187 |
| Umfang: | 8 S. |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV009241218 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | t| | ||
| 008 | 940313s1988 xx |||| 00||| und d | ||
| 035 | |a (OCoLC)632898578 | ||
| 035 | |a (DE-599)BVBBV009241218 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | |a und | ||
| 049 | |a DE-29T | ||
| 100 | 1 | |a Langston, Michael A. |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a On a proposed divide-and-conquer minimal spanning tree algorithm |c Michael A. Langston and Ivan Stojmenović |
| 264 | 1 | |a Pullman, Wash. |c 1988 | |
| 300 | |a 8 S. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a Washington State University <Pullman, Wash.> / Computer Science Department: CS |v 187 | |
| 700 | 1 | |a Stojmenović, Ivan |e Verfasser |4 aut | |
| 810 | 2 | |a Computer Science Department: CS |t Washington State University <Pullman, Wash.> |v 187 |w (DE-604)BV008929975 |9 187 | |
| 943 | 1 | |a oai:aleph.bib-bvb.de:BVB01-006148046 | |
Datensatz im Suchindex
| _version_ | 1818951464336228352 |
|---|---|
| any_adam_object | |
| author | Langston, Michael A. Stojmenović, Ivan |
| author_facet | Langston, Michael A. Stojmenović, Ivan |
| author_role | aut aut |
| author_sort | Langston, Michael A. |
| author_variant | m a l ma mal i s is |
| building | Verbundindex |
| bvnumber | BV009241218 |
| ctrlnum | (OCoLC)632898578 (DE-599)BVBBV009241218 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>00972nam a2200277 cb4500</leader><controlfield tag="001">BV009241218</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t|</controlfield><controlfield tag="008">940313s1988 xx |||| 00||| und d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)632898578</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV009241218</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=" " ind2=" "><subfield code="a">und</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-29T</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Langston, Michael A.</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">On a proposed divide-and-conquer minimal spanning tree algorithm</subfield><subfield code="c">Michael A. Langston and Ivan Stojmenović</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Pullman, Wash.</subfield><subfield code="c">1988</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">Washington State University <Pullman, Wash.> / Computer Science Department: CS</subfield><subfield code="v">187</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Stojmenović, Ivan</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="810" ind1="2" ind2=" "><subfield code="a">Computer Science Department: CS</subfield><subfield code="t">Washington State University <Pullman, Wash.></subfield><subfield code="v">187</subfield><subfield code="w">(DE-604)BV008929975</subfield><subfield code="9">187</subfield></datafield><datafield tag="943" ind1="1" ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-006148046</subfield></datafield></record></collection> |
| id | DE-604.BV009241218 |
| illustrated | Not Illustrated |
| indexdate | 2024-12-20T09:34:54Z |
| institution | BVB |
| language | Undetermined |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-006148046 |
| oclc_num | 632898578 |
| open_access_boolean | |
| owner | DE-29T |
| owner_facet | DE-29T |
| physical | 8 S. |
| publishDate | 1988 |
| publishDateSearch | 1988 |
| publishDateSort | 1988 |
| record_format | marc |
| series2 | Washington State University <Pullman, Wash.> / Computer Science Department: CS |
| spelling | Langston, Michael A. Verfasser aut On a proposed divide-and-conquer minimal spanning tree algorithm Michael A. Langston and Ivan Stojmenović Pullman, Wash. 1988 8 S. txt rdacontent n rdamedia nc rdacarrier Washington State University <Pullman, Wash.> / Computer Science Department: CS 187 Stojmenović, Ivan Verfasser aut Computer Science Department: CS Washington State University <Pullman, Wash.> 187 (DE-604)BV008929975 187 |
| spellingShingle | Langston, Michael A. Stojmenović, Ivan On a proposed divide-and-conquer minimal spanning tree algorithm |
| title | On a proposed divide-and-conquer minimal spanning tree algorithm |
| title_auth | On a proposed divide-and-conquer minimal spanning tree algorithm |
| title_exact_search | On a proposed divide-and-conquer minimal spanning tree algorithm |
| title_full | On a proposed divide-and-conquer minimal spanning tree algorithm Michael A. Langston and Ivan Stojmenović |
| title_fullStr | On a proposed divide-and-conquer minimal spanning tree algorithm Michael A. Langston and Ivan Stojmenović |
| title_full_unstemmed | On a proposed divide-and-conquer minimal spanning tree algorithm Michael A. Langston and Ivan Stojmenović |
| title_short | On a proposed divide-and-conquer minimal spanning tree algorithm |
| title_sort | on a proposed divide and conquer minimal spanning tree algorithm |
| volume_link | (DE-604)BV008929975 |
| work_keys_str_mv | AT langstonmichaela onaproposeddivideandconquerminimalspanningtreealgorithm AT stojmenovicivan onaproposeddivideandconquerminimalspanningtreealgorithm |