Graphs and algorithms:
Gespeichert in:
| Hauptverfasser: | , |
|---|---|
| Format: | Buch |
| Sprache: | Undetermined |
| Veröffentlicht: |
Chichester u.a.
Wiley
1986
|
| Ausgabe: | Reprint. |
| Schriftenreihe: | A Wiley-Interscience series in discrete mathematics
|
| Schlagworte: | |
| Beschreibung: | EST: Graphes et algorithmes (engl.) |
| Beschreibung: | XIX, 650 S. graph. Darst. |
| ISBN: | 0471103748 |
Internformat
MARC
| LEADER | 00000nam a2200000 c 4500 | ||
|---|---|---|---|
| 001 | BV008551399 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | t | ||
| 008 | 931207s1986 d||| |||| 00||| und d | ||
| 020 | |a 0471103748 |9 0-471-10374-8 | ||
| 035 | |a (OCoLC)258169884 | ||
| 035 | |a (DE-599)BVBBV008551399 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | |a und | ||
| 049 | |a DE-824 | ||
| 082 | 0 | |a 511/.5 | |
| 084 | |a SK 170 |0 (DE-625)143221: |2 rvk | ||
| 100 | 1 | |a Gondran, Michel |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Graphs and algorithms |c Michel Gondran and Michel Minoux |
| 250 | |a Reprint. | ||
| 264 | 1 | |a Chichester u.a. |b Wiley |c 1986 | |
| 300 | |a XIX, 650 S. |b graph. Darst. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 0 | |a A Wiley-Interscience series in discrete mathematics | |
| 500 | |a EST: Graphes et algorithmes (engl.) | ||
| 650 | 0 | 7 | |a Algorithmus |0 (DE-588)4001183-5 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Graphentheorie |0 (DE-588)4113782-6 |2 gnd |9 rswk-swf |
| 689 | 0 | 0 | |a Graphentheorie |0 (DE-588)4113782-6 |D s |
| 689 | 0 | 1 | |a Algorithmus |0 (DE-588)4001183-5 |D s |
| 689 | 0 | |5 DE-604 | |
| 700 | 1 | |a Minoux, Michel |e Verfasser |4 aut | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-005620746 | ||
Datensatz im Suchindex
| _version_ | 1804122886561071104 |
|---|---|
| any_adam_object | |
| author | Gondran, Michel Minoux, Michel |
| author_facet | Gondran, Michel Minoux, Michel |
| author_role | aut aut |
| author_sort | Gondran, Michel |
| author_variant | m g mg m m mm |
| building | Verbundindex |
| bvnumber | BV008551399 |
| classification_rvk | SK 170 |
| ctrlnum | (OCoLC)258169884 (DE-599)BVBBV008551399 |
| dewey-full | 511/.5 |
| dewey-hundreds | 500 - Natural sciences and mathematics |
| dewey-ones | 511 - General principles of mathematics |
| dewey-raw | 511/.5 |
| dewey-search | 511/.5 |
| dewey-sort | 3511 15 |
| dewey-tens | 510 - Mathematics |
| discipline | Mathematik |
| edition | Reprint. |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01223nam a2200385 c 4500</leader><controlfield tag="001">BV008551399</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">931207s1986 d||| |||| 00||| und d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">0471103748</subfield><subfield code="9">0-471-10374-8</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)258169884</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV008551399</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-824</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">511/.5</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">SK 170</subfield><subfield code="0">(DE-625)143221:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Gondran, Michel</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Graphs and algorithms</subfield><subfield code="c">Michel Gondran and Michel Minoux</subfield></datafield><datafield tag="250" ind1=" " ind2=" "><subfield code="a">Reprint.</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Chichester u.a.</subfield><subfield code="b">Wiley</subfield><subfield code="c">1986</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">XIX, 650 S.</subfield><subfield code="b">graph. Darst.</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="0" ind2=" "><subfield code="a">A Wiley-Interscience series in discrete mathematics</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">EST: Graphes et algorithmes (engl.)</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Algorithmus</subfield><subfield code="0">(DE-588)4001183-5</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Graphentheorie</subfield><subfield code="0">(DE-588)4113782-6</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Graphentheorie</subfield><subfield code="0">(DE-588)4113782-6</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="1"><subfield code="a">Algorithmus</subfield><subfield code="0">(DE-588)4001183-5</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Minoux, Michel</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-005620746</subfield></datafield></record></collection> |
| id | DE-604.BV008551399 |
| illustrated | Illustrated |
| indexdate | 2024-07-09T17:21:00Z |
| institution | BVB |
| isbn | 0471103748 |
| language | Undetermined |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-005620746 |
| oclc_num | 258169884 |
| open_access_boolean | |
| owner | DE-824 |
| owner_facet | DE-824 |
| physical | XIX, 650 S. graph. Darst. |
| publishDate | 1986 |
| publishDateSearch | 1986 |
| publishDateSort | 1986 |
| publisher | Wiley |
| record_format | marc |
| series2 | A Wiley-Interscience series in discrete mathematics |
| spelling | Gondran, Michel Verfasser aut Graphs and algorithms Michel Gondran and Michel Minoux Reprint. Chichester u.a. Wiley 1986 XIX, 650 S. graph. Darst. txt rdacontent n rdamedia nc rdacarrier A Wiley-Interscience series in discrete mathematics EST: Graphes et algorithmes (engl.) Algorithmus (DE-588)4001183-5 gnd rswk-swf Graphentheorie (DE-588)4113782-6 gnd rswk-swf Graphentheorie (DE-588)4113782-6 s Algorithmus (DE-588)4001183-5 s DE-604 Minoux, Michel Verfasser aut |
| spellingShingle | Gondran, Michel Minoux, Michel Graphs and algorithms Algorithmus (DE-588)4001183-5 gnd Graphentheorie (DE-588)4113782-6 gnd |
| subject_GND | (DE-588)4001183-5 (DE-588)4113782-6 |
| title | Graphs and algorithms |
| title_auth | Graphs and algorithms |
| title_exact_search | Graphs and algorithms |
| title_full | Graphs and algorithms Michel Gondran and Michel Minoux |
| title_fullStr | Graphs and algorithms Michel Gondran and Michel Minoux |
| title_full_unstemmed | Graphs and algorithms Michel Gondran and Michel Minoux |
| title_short | Graphs and algorithms |
| title_sort | graphs and algorithms |
| topic | Algorithmus (DE-588)4001183-5 gnd Graphentheorie (DE-588)4113782-6 gnd |
| topic_facet | Algorithmus Graphentheorie |
| work_keys_str_mv | AT gondranmichel graphsandalgorithms AT minouxmichel graphsandalgorithms |