Data structures and network algorithms:
Gespeichert in:
1. Verfasser: | |
---|---|
Format: | Buch |
Sprache: | English |
Veröffentlicht: |
Philadelphia, Pa.
Soc. for Industrial and Applied Mathematics
1983
|
Schriftenreihe: | Regional conference series in applied mathematics
44 |
Schlagworte: | |
Beschreibung: | 131 S. graph. Darst. |
ISBN: | 0898711878 |
Internformat
MARC
LEADER | 00000nam a2200000 cb4500 | ||
---|---|---|---|
001 | BV009073557 | ||
003 | DE-604 | ||
005 | 00000000000000.0 | ||
007 | t | ||
008 | 940227s1983 d||| |||| 00||| eng d | ||
020 | |a 0898711878 |9 0-89871-187-8 | ||
035 | |a (OCoLC)10120539 | ||
035 | |a (DE-599)BVBBV009073557 | ||
040 | |a DE-604 |b ger |e rakddb | ||
041 | 0 | |a eng | |
049 | |a DE-29T | ||
050 | 0 | |a QA76.9.D35 | |
082 | 0 | |a 001.64/2 |2 19 | |
084 | |a SI 196 |0 (DE-625)143099: |2 rvk | ||
084 | |a ST 270 |0 (DE-625)143638: |2 rvk | ||
100 | 1 | |a Tarjan, Robert E. |e Verfasser |4 aut | |
245 | 1 | 0 | |a Data structures and network algorithms |
264 | 1 | |a Philadelphia, Pa. |b Soc. for Industrial and Applied Mathematics |c 1983 | |
300 | |a 131 S. |b graph. Darst. | ||
336 | |b txt |2 rdacontent | ||
337 | |b n |2 rdamedia | ||
338 | |b nc |2 rdacarrier | ||
490 | 1 | |a Regional conference series in applied mathematics |v 44 | |
650 | 4 | |a Algorithmes | |
650 | 7 | |a Algorithmes |2 ram | |
650 | 7 | |a Algoritmen |2 gtt | |
650 | 4 | |a Arbres (Théorie des graphes) | |
650 | 7 | |a Arbres (théorie des graphes) |2 ram | |
650 | 7 | |a Datastructuren |2 gtt | |
650 | 7 | |a Grafentheorie |2 gtt | |
650 | 4 | |a Structures de données (Informatique) | |
650 | 7 | |a Structures de données (informatique) |2 ram | |
650 | 7 | |a algorithme réseau |2 inriac | |
650 | 7 | |a arbre |2 inriac | |
650 | 7 | |a graphe |2 inriac | |
650 | 7 | |a structure donnée |2 inriac | |
650 | 4 | |a Computer algorithms | |
650 | 4 | |a Data structures (Computer science) | |
650 | 4 | |a Trees (Graph theory) | |
650 | 0 | 7 | |a Datenstruktur |0 (DE-588)4011146-5 |2 gnd |9 rswk-swf |
650 | 0 | 7 | |a Optimierung |0 (DE-588)4043664-0 |2 gnd |9 rswk-swf |
650 | 0 | 7 | |a Netzwerk |0 (DE-588)4171529-9 |2 gnd |9 rswk-swf |
650 | 0 | 7 | |a Computer |0 (DE-588)4070083-5 |2 gnd |9 rswk-swf |
650 | 0 | 7 | |a Graph |0 (DE-588)4021842-9 |2 gnd |9 rswk-swf |
650 | 0 | 7 | |a Algorithmus |0 (DE-588)4001183-5 |2 gnd |9 rswk-swf |
650 | 0 | 7 | |a Netzwerktheorie |0 (DE-588)4171531-7 |2 gnd |9 rswk-swf |
689 | 0 | 0 | |a Algorithmus |0 (DE-588)4001183-5 |D s |
689 | 0 | 1 | |a Datenstruktur |0 (DE-588)4011146-5 |D s |
689 | 0 | 2 | |a Graph |0 (DE-588)4021842-9 |D s |
689 | 0 | 3 | |a Netzwerk |0 (DE-588)4171529-9 |D s |
689 | 0 | |8 1\p |5 DE-604 | |
689 | 1 | 0 | |a Computer |0 (DE-588)4070083-5 |D s |
689 | 1 | 1 | |a Datenstruktur |0 (DE-588)4011146-5 |D s |
689 | 1 | |8 2\p |5 DE-604 | |
689 | 2 | 0 | |a Netzwerktheorie |0 (DE-588)4171531-7 |D s |
689 | 2 | 1 | |a Optimierung |0 (DE-588)4043664-0 |D s |
689 | 2 | |8 3\p |5 DE-604 | |
830 | 0 | |a Regional conference series in applied mathematics |v 44 |w (DE-604)BV000016696 |9 44 | |
999 | |a oai:aleph.bib-bvb.de:BVB01-006011071 | ||
883 | 1 | |8 1\p |a cgwrk |d 20201028 |q DE-101 |u https://d-nb.info/provenance/plan#cgwrk | |
883 | 1 | |8 2\p |a cgwrk |d 20201028 |q DE-101 |u https://d-nb.info/provenance/plan#cgwrk | |
883 | 1 | |8 3\p |a cgwrk |d 20201028 |q DE-101 |u https://d-nb.info/provenance/plan#cgwrk |
Datensatz im Suchindex
_version_ | 1804123486739759104 |
---|---|
any_adam_object | |
author | Tarjan, Robert E. |
author_facet | Tarjan, Robert E. |
author_role | aut |
author_sort | Tarjan, Robert E. |
author_variant | r e t re ret |
building | Verbundindex |
bvnumber | BV009073557 |
callnumber-first | Q - Science |
callnumber-label | QA76 |
callnumber-raw | QA76.9.D35 |
callnumber-search | QA76.9.D35 |
callnumber-sort | QA 276.9 D35 |
callnumber-subject | QA - Mathematics |
classification_rvk | SI 196 ST 270 |
ctrlnum | (OCoLC)10120539 (DE-599)BVBBV009073557 |
dewey-full | 001.64/2 |
dewey-hundreds | 000 - Computer science, information, general works |
dewey-ones | 001 - Knowledge |
dewey-raw | 001.64/2 |
dewey-search | 001.64/2 |
dewey-sort | 11.64 12 |
dewey-tens | 000 - Computer science, information, general works |
discipline | Allgemeines Informatik Mathematik |
format | Book |
fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02850nam a2200769 cb4500</leader><controlfield tag="001">BV009073557</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">940227s1983 d||| |||| 00||| eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">0898711878</subfield><subfield code="9">0-89871-187-8</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)10120539</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV009073557</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-29T</subfield></datafield><datafield tag="050" ind1=" " ind2="0"><subfield code="a">QA76.9.D35</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">001.64/2</subfield><subfield code="2">19</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">SI 196</subfield><subfield code="0">(DE-625)143099:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">ST 270</subfield><subfield code="0">(DE-625)143638:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Tarjan, Robert E.</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Data structures and network algorithms</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Philadelphia, Pa.</subfield><subfield code="b">Soc. for Industrial and Applied Mathematics</subfield><subfield code="c">1983</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">131 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="1" ind2=" "><subfield code="a">Regional conference series in applied mathematics</subfield><subfield code="v">44</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Algorithmes</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Algorithmes</subfield><subfield code="2">ram</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Algoritmen</subfield><subfield code="2">gtt</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Arbres (Théorie des graphes)</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Arbres (théorie des graphes)</subfield><subfield code="2">ram</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Datastructuren</subfield><subfield code="2">gtt</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Grafentheorie</subfield><subfield code="2">gtt</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Structures de données (Informatique)</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Structures de données (informatique)</subfield><subfield code="2">ram</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">algorithme réseau</subfield><subfield code="2">inriac</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">arbre</subfield><subfield code="2">inriac</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">graphe</subfield><subfield code="2">inriac</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">structure donnée</subfield><subfield code="2">inriac</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computer algorithms</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Data structures (Computer science)</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Trees (Graph theory)</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Datenstruktur</subfield><subfield code="0">(DE-588)4011146-5</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Optimierung</subfield><subfield code="0">(DE-588)4043664-0</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Netzwerk</subfield><subfield code="0">(DE-588)4171529-9</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Computer</subfield><subfield code="0">(DE-588)4070083-5</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Graph</subfield><subfield code="0">(DE-588)4021842-9</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</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">Netzwerktheorie</subfield><subfield code="0">(DE-588)4171531-7</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><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="1"><subfield code="a">Datenstruktur</subfield><subfield code="0">(DE-588)4011146-5</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="2"><subfield code="a">Graph</subfield><subfield code="0">(DE-588)4021842-9</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="3"><subfield code="a">Netzwerk</subfield><subfield code="0">(DE-588)4171529-9</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="8">1\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="1" ind2="0"><subfield code="a">Computer</subfield><subfield code="0">(DE-588)4070083-5</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2="1"><subfield code="a">Datenstruktur</subfield><subfield code="0">(DE-588)4011146-5</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2=" "><subfield code="8">2\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="2" ind2="0"><subfield code="a">Netzwerktheorie</subfield><subfield code="0">(DE-588)4171531-7</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="2" ind2="1"><subfield code="a">Optimierung</subfield><subfield code="0">(DE-588)4043664-0</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="2" ind2=" "><subfield code="8">3\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">Regional conference series in applied mathematics</subfield><subfield code="v">44</subfield><subfield code="w">(DE-604)BV000016696</subfield><subfield code="9">44</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-006011071</subfield></datafield><datafield tag="883" ind1="1" ind2=" "><subfield code="8">1\p</subfield><subfield code="a">cgwrk</subfield><subfield code="d">20201028</subfield><subfield code="q">DE-101</subfield><subfield code="u">https://d-nb.info/provenance/plan#cgwrk</subfield></datafield><datafield tag="883" ind1="1" ind2=" "><subfield code="8">2\p</subfield><subfield code="a">cgwrk</subfield><subfield code="d">20201028</subfield><subfield code="q">DE-101</subfield><subfield code="u">https://d-nb.info/provenance/plan#cgwrk</subfield></datafield><datafield tag="883" ind1="1" ind2=" "><subfield code="8">3\p</subfield><subfield code="a">cgwrk</subfield><subfield code="d">20201028</subfield><subfield code="q">DE-101</subfield><subfield code="u">https://d-nb.info/provenance/plan#cgwrk</subfield></datafield></record></collection> |
id | DE-604.BV009073557 |
illustrated | Illustrated |
indexdate | 2024-07-09T17:30:32Z |
institution | BVB |
isbn | 0898711878 |
language | English |
oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-006011071 |
oclc_num | 10120539 |
open_access_boolean | |
owner | DE-29T |
owner_facet | DE-29T |
physical | 131 S. graph. Darst. |
publishDate | 1983 |
publishDateSearch | 1983 |
publishDateSort | 1983 |
publisher | Soc. for Industrial and Applied Mathematics |
record_format | marc |
series | Regional conference series in applied mathematics |
series2 | Regional conference series in applied mathematics |
spelling | Tarjan, Robert E. Verfasser aut Data structures and network algorithms Philadelphia, Pa. Soc. for Industrial and Applied Mathematics 1983 131 S. graph. Darst. txt rdacontent n rdamedia nc rdacarrier Regional conference series in applied mathematics 44 Algorithmes Algorithmes ram Algoritmen gtt Arbres (Théorie des graphes) Arbres (théorie des graphes) ram Datastructuren gtt Grafentheorie gtt Structures de données (Informatique) Structures de données (informatique) ram algorithme réseau inriac arbre inriac graphe inriac structure donnée inriac Computer algorithms Data structures (Computer science) Trees (Graph theory) Datenstruktur (DE-588)4011146-5 gnd rswk-swf Optimierung (DE-588)4043664-0 gnd rswk-swf Netzwerk (DE-588)4171529-9 gnd rswk-swf Computer (DE-588)4070083-5 gnd rswk-swf Graph (DE-588)4021842-9 gnd rswk-swf Algorithmus (DE-588)4001183-5 gnd rswk-swf Netzwerktheorie (DE-588)4171531-7 gnd rswk-swf Algorithmus (DE-588)4001183-5 s Datenstruktur (DE-588)4011146-5 s Graph (DE-588)4021842-9 s Netzwerk (DE-588)4171529-9 s 1\p DE-604 Computer (DE-588)4070083-5 s 2\p DE-604 Netzwerktheorie (DE-588)4171531-7 s Optimierung (DE-588)4043664-0 s 3\p DE-604 Regional conference series in applied mathematics 44 (DE-604)BV000016696 44 1\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk 2\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk 3\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk |
spellingShingle | Tarjan, Robert E. Data structures and network algorithms Regional conference series in applied mathematics Algorithmes Algorithmes ram Algoritmen gtt Arbres (Théorie des graphes) Arbres (théorie des graphes) ram Datastructuren gtt Grafentheorie gtt Structures de données (Informatique) Structures de données (informatique) ram algorithme réseau inriac arbre inriac graphe inriac structure donnée inriac Computer algorithms Data structures (Computer science) Trees (Graph theory) Datenstruktur (DE-588)4011146-5 gnd Optimierung (DE-588)4043664-0 gnd Netzwerk (DE-588)4171529-9 gnd Computer (DE-588)4070083-5 gnd Graph (DE-588)4021842-9 gnd Algorithmus (DE-588)4001183-5 gnd Netzwerktheorie (DE-588)4171531-7 gnd |
subject_GND | (DE-588)4011146-5 (DE-588)4043664-0 (DE-588)4171529-9 (DE-588)4070083-5 (DE-588)4021842-9 (DE-588)4001183-5 (DE-588)4171531-7 |
title | Data structures and network algorithms |
title_auth | Data structures and network algorithms |
title_exact_search | Data structures and network algorithms |
title_full | Data structures and network algorithms |
title_fullStr | Data structures and network algorithms |
title_full_unstemmed | Data structures and network algorithms |
title_short | Data structures and network algorithms |
title_sort | data structures and network algorithms |
topic | Algorithmes Algorithmes ram Algoritmen gtt Arbres (Théorie des graphes) Arbres (théorie des graphes) ram Datastructuren gtt Grafentheorie gtt Structures de données (Informatique) Structures de données (informatique) ram algorithme réseau inriac arbre inriac graphe inriac structure donnée inriac Computer algorithms Data structures (Computer science) Trees (Graph theory) Datenstruktur (DE-588)4011146-5 gnd Optimierung (DE-588)4043664-0 gnd Netzwerk (DE-588)4171529-9 gnd Computer (DE-588)4070083-5 gnd Graph (DE-588)4021842-9 gnd Algorithmus (DE-588)4001183-5 gnd Netzwerktheorie (DE-588)4171531-7 gnd |
topic_facet | Algorithmes Algoritmen Arbres (Théorie des graphes) Arbres (théorie des graphes) Datastructuren Grafentheorie Structures de données (Informatique) Structures de données (informatique) algorithme réseau arbre graphe structure donnée Computer algorithms Data structures (Computer science) Trees (Graph theory) Datenstruktur Optimierung Netzwerk Computer Graph Algorithmus Netzwerktheorie |
volume_link | (DE-604)BV000016696 |
work_keys_str_mv | AT tarjanroberte datastructuresandnetworkalgorithms |