Stepwise construction of an efficient distributed traversing algorithm for general strongly connected directed graphs (or traversing one way streets with no maps:
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Buch |
| Sprache: | Undetermined |
| Veröffentlicht: |
Haifa, Israel
1986
|
| Schriftenreihe: | haṭ- Ṭeḵniyyôn, Māḵôn Ṭeḵnôlôgî le-Yiśrā'ēl <Ḥêfā> / Department of Computer Science: Technical report
431 |
| Beschreibung: | 11 Bl.S. |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV010509640 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | t | ||
| 008 | 951205s1986 |||| 00||| undod | ||
| 035 | |a (OCoLC)633345939 | ||
| 035 | |a (DE-599)BVBBV010509640 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | |a und | ||
| 049 | |a DE-91G | ||
| 100 | 1 | |a Kutten, Shay |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Stepwise construction of an efficient distributed traversing algorithm for general strongly connected directed graphs (or traversing one way streets with no maps |
| 264 | 1 | |a Haifa, Israel |c 1986 | |
| 300 | |a 11 Bl.S. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a haṭ- Ṭeḵniyyôn, Māḵôn Ṭeḵnôlôgî le-Yiśrā'ēl <Ḥêfā> / Department of Computer Science: Technical report |v 431 | |
| 810 | 2 | |a Department of Computer Science: Technical report |t <<haṭ->> Ṭeḵniyyôn, Māḵôn Ṭeḵnôlôgî le-Yiśrā'ēl <Ḥêfā> |v 431 |w (DE-604)BV010499135 |9 431 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-007005103 | ||
Datensatz im Suchindex
| _version_ | 1804124976145498112 |
|---|---|
| any_adam_object | |
| author | Kutten, Shay |
| author_facet | Kutten, Shay |
| author_role | aut |
| author_sort | Kutten, Shay |
| author_variant | s k sk |
| building | Verbundindex |
| bvnumber | BV010509640 |
| ctrlnum | (OCoLC)633345939 (DE-599)BVBBV010509640 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01073nam a2200265 cb4500</leader><controlfield tag="001">BV010509640</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">951205s1986 |||| 00||| undod</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)633345939</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV010509640</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-91G</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Kutten, Shay</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Stepwise construction of an efficient distributed traversing algorithm for general strongly connected directed graphs (or traversing one way streets with no maps</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Haifa, Israel</subfield><subfield code="c">1986</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">11 Bl.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">haṭ- Ṭeḵniyyôn, Māḵôn Ṭeḵnôlôgî le-Yiśrā'ēl <Ḥêfā> / Department of Computer Science: Technical report</subfield><subfield code="v">431</subfield></datafield><datafield tag="810" ind1="2" ind2=" "><subfield code="a">Department of Computer Science: Technical report</subfield><subfield code="t"><<haṭ->> Ṭeḵniyyôn, Māḵôn Ṭeḵnôlôgî le-Yiśrā'ēl <Ḥêfā></subfield><subfield code="v">431</subfield><subfield code="w">(DE-604)BV010499135</subfield><subfield code="9">431</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-007005103</subfield></datafield></record></collection> |
| id | DE-604.BV010509640 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T17:54:13Z |
| institution | BVB |
| language | Undetermined |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-007005103 |
| oclc_num | 633345939 |
| open_access_boolean | |
| owner | DE-91G DE-BY-TUM |
| owner_facet | DE-91G DE-BY-TUM |
| physical | 11 Bl.S. |
| publishDate | 1986 |
| publishDateSearch | 1986 |
| publishDateSort | 1986 |
| record_format | marc |
| series2 | haṭ- Ṭeḵniyyôn, Māḵôn Ṭeḵnôlôgî le-Yiśrā'ēl <Ḥêfā> / Department of Computer Science: Technical report |
| spelling | Kutten, Shay Verfasser aut Stepwise construction of an efficient distributed traversing algorithm for general strongly connected directed graphs (or traversing one way streets with no maps Haifa, Israel 1986 11 Bl.S. txt rdacontent n rdamedia nc rdacarrier haṭ- Ṭeḵniyyôn, Māḵôn Ṭeḵnôlôgî le-Yiśrā'ēl <Ḥêfā> / Department of Computer Science: Technical report 431 Department of Computer Science: Technical report <<haṭ->> Ṭeḵniyyôn, Māḵôn Ṭeḵnôlôgî le-Yiśrā'ēl <Ḥêfā> 431 (DE-604)BV010499135 431 |
| spellingShingle | Kutten, Shay Stepwise construction of an efficient distributed traversing algorithm for general strongly connected directed graphs (or traversing one way streets with no maps |
| title | Stepwise construction of an efficient distributed traversing algorithm for general strongly connected directed graphs (or traversing one way streets with no maps |
| title_auth | Stepwise construction of an efficient distributed traversing algorithm for general strongly connected directed graphs (or traversing one way streets with no maps |
| title_exact_search | Stepwise construction of an efficient distributed traversing algorithm for general strongly connected directed graphs (or traversing one way streets with no maps |
| title_full | Stepwise construction of an efficient distributed traversing algorithm for general strongly connected directed graphs (or traversing one way streets with no maps |
| title_fullStr | Stepwise construction of an efficient distributed traversing algorithm for general strongly connected directed graphs (or traversing one way streets with no maps |
| title_full_unstemmed | Stepwise construction of an efficient distributed traversing algorithm for general strongly connected directed graphs (or traversing one way streets with no maps |
| title_short | Stepwise construction of an efficient distributed traversing algorithm for general strongly connected directed graphs (or traversing one way streets with no maps |
| title_sort | stepwise construction of an efficient distributed traversing algorithm for general strongly connected directed graphs or traversing one way streets with no maps |
| volume_link | (DE-604)BV010499135 |
| work_keys_str_mv | AT kuttenshay stepwiseconstructionofanefficientdistributedtraversingalgorithmforgeneralstronglyconnecteddirectedgraphsortraversingonewaystreetswithnomaps |