Graph algorithms = iteration + data structures?: [The structure of graph algorithms and a corresponding style of programming]
Saved in:
| Main Author: | |
|---|---|
| Format: | Book |
| Language: | English |
| Published: |
Hagen
Fernuniv., Gesamthochsch.
1992
|
| Series: | Informatik-Berichte
131 |
| Physical Description: | 16 S. |
Staff View
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV006626279 | ||
| 003 | DE-604 | ||
| 005 | 19930421 | ||
| 007 | t| | ||
| 008 | 930315s1992 gw |||| 00||| eng d | ||
| 035 | |a (OCoLC)64249717 | ||
| 035 | |a (DE-599)BVBBV006626279 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 044 | |a gw |c DE | ||
| 049 | |a DE-12 | ||
| 100 | 1 | |a Erwig, Martin |d 1963- |e Verfasser |0 (DE-588)120741571 |4 aut | |
| 245 | 1 | 0 | |a Graph algorithms = iteration + data structures? |b [The structure of graph algorithms and a corresponding style of programming] |c Martin Erwig |
| 264 | 1 | |a Hagen |b Fernuniv., Gesamthochsch. |c 1992 | |
| 300 | |a 16 S. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a Informatik-Berichte |v 131 | |
| 830 | 0 | |a Informatik-Berichte |v 131 |w (DE-604)BV000001277 |9 131 | |
| 943 | 1 | |a oai:aleph.bib-bvb.de:BVB01-004235240 | |
Record in the Search Index
| _version_ | 1818948762813333504 |
|---|---|
| any_adam_object | |
| author | Erwig, Martin 1963- |
| author_GND | (DE-588)120741571 |
| author_facet | Erwig, Martin 1963- |
| author_role | aut |
| author_sort | Erwig, Martin 1963- |
| author_variant | m e me |
| building | Verbundindex |
| bvnumber | BV006626279 |
| ctrlnum | (OCoLC)64249717 (DE-599)BVBBV006626279 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>00895nam a2200277 cb4500</leader><controlfield tag="001">BV006626279</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">19930421 </controlfield><controlfield tag="007">t|</controlfield><controlfield tag="008">930315s1992 gw |||| 00||| eng d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)64249717</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV006626279</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="044" ind1=" " ind2=" "><subfield code="a">gw</subfield><subfield code="c">DE</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-12</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Erwig, Martin</subfield><subfield code="d">1963-</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)120741571</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Graph algorithms = iteration + data structures?</subfield><subfield code="b">[The structure of graph algorithms and a corresponding style of programming]</subfield><subfield code="c">Martin Erwig</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Hagen</subfield><subfield code="b">Fernuniv., Gesamthochsch.</subfield><subfield code="c">1992</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">16 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">Informatik-Berichte</subfield><subfield code="v">131</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">Informatik-Berichte</subfield><subfield code="v">131</subfield><subfield code="w">(DE-604)BV000001277</subfield><subfield code="9">131</subfield></datafield><datafield tag="943" ind1="1" ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-004235240</subfield></datafield></record></collection> |
| id | DE-604.BV006626279 |
| illustrated | Not Illustrated |
| indexdate | 2024-12-20T08:51:57Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-004235240 |
| oclc_num | 64249717 |
| open_access_boolean | |
| owner | DE-12 |
| owner_facet | DE-12 |
| physical | 16 S. |
| publishDate | 1992 |
| publishDateSearch | 1992 |
| publishDateSort | 1992 |
| publisher | Fernuniv., Gesamthochsch. |
| record_format | marc |
| series | Informatik-Berichte |
| series2 | Informatik-Berichte |
| spelling | Erwig, Martin 1963- Verfasser (DE-588)120741571 aut Graph algorithms = iteration + data structures? [The structure of graph algorithms and a corresponding style of programming] Martin Erwig Hagen Fernuniv., Gesamthochsch. 1992 16 S. txt rdacontent n rdamedia nc rdacarrier Informatik-Berichte 131 Informatik-Berichte 131 (DE-604)BV000001277 131 |
| spellingShingle | Erwig, Martin 1963- Graph algorithms = iteration + data structures? [The structure of graph algorithms and a corresponding style of programming] Informatik-Berichte |
| title | Graph algorithms = iteration + data structures? [The structure of graph algorithms and a corresponding style of programming] |
| title_auth | Graph algorithms = iteration + data structures? [The structure of graph algorithms and a corresponding style of programming] |
| title_exact_search | Graph algorithms = iteration + data structures? [The structure of graph algorithms and a corresponding style of programming] |
| title_full | Graph algorithms = iteration + data structures? [The structure of graph algorithms and a corresponding style of programming] Martin Erwig |
| title_fullStr | Graph algorithms = iteration + data structures? [The structure of graph algorithms and a corresponding style of programming] Martin Erwig |
| title_full_unstemmed | Graph algorithms = iteration + data structures? [The structure of graph algorithms and a corresponding style of programming] Martin Erwig |
| title_short | Graph algorithms = iteration + data structures? |
| title_sort | graph algorithms iteration data structures the structure of graph algorithms and a corresponding style of programming |
| title_sub | [The structure of graph algorithms and a corresponding style of programming] |
| volume_link | (DE-604)BV000001277 |
| work_keys_str_mv | AT erwigmartin graphalgorithmsiterationdatastructuresthestructureofgraphalgorithmsandacorrespondingstyleofprogramming |