Combinatorial algorithms: an update
Gespeichert in:
1. Verfasser: | |
---|---|
Format: | Elektronisch E-Book |
Sprache: | English |
Veröffentlicht: |
Philadelphia, Pa.
Society for Industrial and Applied Mathematics (SIAM, 3600 Market Street, Floor 6, Philadelphia, PA 19104)
1989
|
Schriftenreihe: | CBMS-NSF regional conference series in applied mathematics
55 |
Schlagworte: | |
Online-Zugang: | TUM01 UBW01 UBY01 UER01 Volltext |
Beschreibung: | Mode of access: World Wide Web. - System requirements: Adobe Acrobat Reader Includes bibliographical references (s. 43-45) The original gray code -- Other gray codes -- Variations on the theme -- Choosing 2-samples -- Listing rooted trees -- Random selection of trees -- Listing free trees -- Generating random graphs A survey of some of the work that has been done since the appearance of the second edition of Combinatorial Algorithms. Topics include progress in: Gray Codes, listing of subsets of given size of a given universe, listing rooted and free trees, selecting free trees and unlabeled graphs uniformly at random, and ranking and unranking problems on unlabeled trees Update ed. of: Combinatorial algorithms for computers and calculators / Albert Nijenhuis and Herbert S. Wilf. 2nd ed. 1978. - Based on a series of 10 lectures given at the CBMS-NSF Conference on Selection Algorithms for Combinatorial Objects, held in the summer of 1987 at the Baca Grande campus of Colorado College |
Beschreibung: | 1 Online-Ressource (v, 47 Seiten) |
ISBN: | 0898712319 9780898712315 |
DOI: | 10.1137/1.9781611970166 |
Internformat
MARC
LEADER | 00000nmm a2200000zcb4500 | ||
---|---|---|---|
001 | BV039747284 | ||
003 | DE-604 | ||
005 | 20210210 | ||
007 | cr|uuu---uuuuu | ||
008 | 111207s1989 sz |||| o||u| ||||||eng d | ||
010 | |a 89006070 | ||
020 | |a 0898712319 |c pbk. |9 0898712319 | ||
020 | |a 9780898712315 |c pbk. |9 9780898712315 | ||
024 | 7 | |a 10.1137/1.9781611970166 |2 doi | |
035 | |a (OCoLC)873886344 | ||
035 | |a (DE-599)BVBBV039747284 | ||
040 | |a DE-604 |b ger |e rda | ||
041 | 0 | |a eng | |
044 | |a sz |c XA-CH | ||
049 | |a DE-91 |a DE-29 |a DE-706 |a DE-83 |a DE-20 | ||
084 | |a SI 196 |0 (DE-625)143099: |2 rvk | ||
100 | 1 | |a Wilf, Herbert S. |d 1931-2012 |e Verfasser |0 (DE-588)172451906 |4 aut | |
245 | 1 | 0 | |a Combinatorial algorithms |b an update |c Herbert S. Wilf |
264 | 1 | |a Philadelphia, Pa. |b Society for Industrial and Applied Mathematics (SIAM, 3600 Market Street, Floor 6, Philadelphia, PA 19104) |c 1989 | |
300 | |a 1 Online-Ressource (v, 47 Seiten) | ||
336 | |b txt |2 rdacontent | ||
337 | |b c |2 rdamedia | ||
338 | |b cr |2 rdacarrier | ||
490 | 1 | |a CBMS-NSF regional conference series in applied mathematics |v 55 | |
500 | |a Mode of access: World Wide Web. - System requirements: Adobe Acrobat Reader | ||
500 | |a Includes bibliographical references (s. 43-45) | ||
500 | |a The original gray code -- Other gray codes -- Variations on the theme -- Choosing 2-samples -- Listing rooted trees -- Random selection of trees -- Listing free trees -- Generating random graphs | ||
500 | |a A survey of some of the work that has been done since the appearance of the second edition of Combinatorial Algorithms. Topics include progress in: Gray Codes, listing of subsets of given size of a given universe, listing rooted and free trees, selecting free trees and unlabeled graphs uniformly at random, and ranking and unranking problems on unlabeled trees | ||
500 | |a Update ed. of: Combinatorial algorithms for computers and calculators / Albert Nijenhuis and Herbert S. Wilf. 2nd ed. 1978. - Based on a series of 10 lectures given at the CBMS-NSF Conference on Selection Algorithms for Combinatorial Objects, held in the summer of 1987 at the Baca Grande campus of Colorado College | ||
650 | 4 | |a Combinatorial analysis | |
650 | 4 | |a Algorithms | |
650 | 0 | 7 | |a Abzählende Kombinatorik |0 (DE-588)4132720-2 |2 gnd |9 rswk-swf |
650 | 0 | 7 | |a Algorithmus |0 (DE-588)4001183-5 |2 gnd |9 rswk-swf |
650 | 0 | 7 | |a Kombinatorische Analysis |0 (DE-588)4164746-4 |2 gnd |9 rswk-swf |
650 | 0 | 7 | |a Kombinatorik |0 (DE-588)4031824-2 |2 gnd |9 rswk-swf |
689 | 0 | 0 | |a Abzählende Kombinatorik |0 (DE-588)4132720-2 |D s |
689 | 0 | 1 | |a Algorithmus |0 (DE-588)4001183-5 |D s |
689 | 0 | |5 DE-604 | |
689 | 1 | 0 | |a Kombinatorische Analysis |0 (DE-588)4164746-4 |D s |
689 | 1 | 1 | |a Algorithmus |0 (DE-588)4001183-5 |D s |
689 | 1 | |8 1\p |5 DE-604 | |
689 | 2 | 0 | |a Kombinatorik |0 (DE-588)4031824-2 |D s |
689 | 2 | 1 | |a Algorithmus |0 (DE-588)4001183-5 |D s |
689 | 2 | |8 2\p |5 DE-604 | |
776 | 0 | 8 | |i Erscheint auch als |n Druck-Ausgabe, Paperback |z 0898712319 |
776 | 0 | 8 | |i Erscheint auch als |n Druck-Ausgabe, Paperback |z 9780898712315 |
830 | 0 | |a CBMS-NSF regional conference series in applied mathematics |v 55 |w (DE-604)BV046682627 |9 55 | |
856 | 4 | 0 | |u https://doi.org/10.1137/1.9781611970166 |x Verlag |z URL des Erstveröffentlichers |3 Volltext |
912 | |a ZDB-72-SIA | ||
999 | |a oai:aleph.bib-bvb.de:BVB01-024594815 | ||
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 | |
966 | e | |u https://doi.org/10.1137/1.9781611970166 |l TUM01 |p ZDB-72-SIA |x Verlag |3 Volltext | |
966 | e | |u https://doi.org/10.1137/1.9781611970166 |l UBW01 |p ZDB-72-SIA |x Verlag |3 Volltext | |
966 | e | |u https://doi.org/10.1137/1.9781611970166 |l UBY01 |p ZDB-72-SIA |x Verlag |3 Volltext | |
966 | e | |u https://doi.org/10.1137/1.9781611970166 |l UER01 |p ZDB-72-SIA |x Verlag |3 Volltext |
Datensatz im Suchindex
_version_ | 1804148637529276416 |
---|---|
any_adam_object | |
author | Wilf, Herbert S. 1931-2012 |
author_GND | (DE-588)172451906 |
author_facet | Wilf, Herbert S. 1931-2012 |
author_role | aut |
author_sort | Wilf, Herbert S. 1931-2012 |
author_variant | h s w hs hsw |
building | Verbundindex |
bvnumber | BV039747284 |
classification_rvk | SI 196 |
collection | ZDB-72-SIA |
ctrlnum | (OCoLC)873886344 (DE-599)BVBBV039747284 |
discipline | Mathematik |
doi_str_mv | 10.1137/1.9781611970166 |
format | Electronic eBook |
fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>03912nmm a2200697zcb4500</leader><controlfield tag="001">BV039747284</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20210210 </controlfield><controlfield tag="007">cr|uuu---uuuuu</controlfield><controlfield tag="008">111207s1989 sz |||| o||u| ||||||eng d</controlfield><datafield tag="010" ind1=" " ind2=" "><subfield code="a">89006070</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">0898712319</subfield><subfield code="c">pbk.</subfield><subfield code="9">0898712319</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9780898712315</subfield><subfield code="c">pbk.</subfield><subfield code="9">9780898712315</subfield></datafield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1137/1.9781611970166</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)873886344</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV039747284</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rda</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="044" ind1=" " ind2=" "><subfield code="a">sz</subfield><subfield code="c">XA-CH</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-91</subfield><subfield code="a">DE-29</subfield><subfield code="a">DE-706</subfield><subfield code="a">DE-83</subfield><subfield code="a">DE-20</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="100" ind1="1" ind2=" "><subfield code="a">Wilf, Herbert S.</subfield><subfield code="d">1931-2012</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)172451906</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Combinatorial algorithms</subfield><subfield code="b">an update</subfield><subfield code="c">Herbert S. Wilf</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Philadelphia, Pa.</subfield><subfield code="b">Society for Industrial and Applied Mathematics (SIAM, 3600 Market Street, Floor 6, Philadelphia, PA 19104)</subfield><subfield code="c">1989</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 Online-Ressource (v, 47 Seiten)</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">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="490" ind1="1" ind2=" "><subfield code="a">CBMS-NSF regional conference series in applied mathematics</subfield><subfield code="v">55</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">Mode of access: World Wide Web. - System requirements: Adobe Acrobat Reader</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">Includes bibliographical references (s. 43-45)</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">The original gray code -- Other gray codes -- Variations on the theme -- Choosing 2-samples -- Listing rooted trees -- Random selection of trees -- Listing free trees -- Generating random graphs</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">A survey of some of the work that has been done since the appearance of the second edition of Combinatorial Algorithms. Topics include progress in: Gray Codes, listing of subsets of given size of a given universe, listing rooted and free trees, selecting free trees and unlabeled graphs uniformly at random, and ranking and unranking problems on unlabeled trees</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">Update ed. of: Combinatorial algorithms for computers and calculators / Albert Nijenhuis and Herbert S. Wilf. 2nd ed. 1978. - Based on a series of 10 lectures given at the CBMS-NSF Conference on Selection Algorithms for Combinatorial Objects, held in the summer of 1987 at the Baca Grande campus of Colorado College</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Combinatorial analysis</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Algorithms</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Abzählende Kombinatorik</subfield><subfield code="0">(DE-588)4132720-2</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">Kombinatorische Analysis</subfield><subfield code="0">(DE-588)4164746-4</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Kombinatorik</subfield><subfield code="0">(DE-588)4031824-2</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Abzählende Kombinatorik</subfield><subfield code="0">(DE-588)4132720-2</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="689" ind1="1" ind2="0"><subfield code="a">Kombinatorische Analysis</subfield><subfield code="0">(DE-588)4164746-4</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" 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="1" ind2=" "><subfield code="8">1\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="2" ind2="0"><subfield code="a">Kombinatorik</subfield><subfield code="0">(DE-588)4031824-2</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="2" 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="2" ind2=" "><subfield code="8">2\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Erscheint auch als</subfield><subfield code="n">Druck-Ausgabe, Paperback</subfield><subfield code="z">0898712319</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Erscheint auch als</subfield><subfield code="n">Druck-Ausgabe, Paperback</subfield><subfield code="z">9780898712315</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">CBMS-NSF regional conference series in applied mathematics</subfield><subfield code="v">55</subfield><subfield code="w">(DE-604)BV046682627</subfield><subfield code="9">55</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.1137/1.9781611970166</subfield><subfield code="x">Verlag</subfield><subfield code="z">URL des Erstveröffentlichers</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-72-SIA</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-024594815</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="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1137/1.9781611970166</subfield><subfield code="l">TUM01</subfield><subfield code="p">ZDB-72-SIA</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1137/1.9781611970166</subfield><subfield code="l">UBW01</subfield><subfield code="p">ZDB-72-SIA</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1137/1.9781611970166</subfield><subfield code="l">UBY01</subfield><subfield code="p">ZDB-72-SIA</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1137/1.9781611970166</subfield><subfield code="l">UER01</subfield><subfield code="p">ZDB-72-SIA</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield></record></collection> |
id | DE-604.BV039747284 |
illustrated | Not Illustrated |
indexdate | 2024-07-10T00:10:18Z |
institution | BVB |
isbn | 0898712319 9780898712315 |
language | English |
lccn | 89006070 |
oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-024594815 |
oclc_num | 873886344 |
open_access_boolean | |
owner | DE-91 DE-BY-TUM DE-29 DE-706 DE-83 DE-20 |
owner_facet | DE-91 DE-BY-TUM DE-29 DE-706 DE-83 DE-20 |
physical | 1 Online-Ressource (v, 47 Seiten) |
psigel | ZDB-72-SIA |
publishDate | 1989 |
publishDateSearch | 1989 |
publishDateSort | 1989 |
publisher | Society for Industrial and Applied Mathematics (SIAM, 3600 Market Street, Floor 6, Philadelphia, PA 19104) |
record_format | marc |
series | CBMS-NSF regional conference series in applied mathematics |
series2 | CBMS-NSF regional conference series in applied mathematics |
spelling | Wilf, Herbert S. 1931-2012 Verfasser (DE-588)172451906 aut Combinatorial algorithms an update Herbert S. Wilf Philadelphia, Pa. Society for Industrial and Applied Mathematics (SIAM, 3600 Market Street, Floor 6, Philadelphia, PA 19104) 1989 1 Online-Ressource (v, 47 Seiten) txt rdacontent c rdamedia cr rdacarrier CBMS-NSF regional conference series in applied mathematics 55 Mode of access: World Wide Web. - System requirements: Adobe Acrobat Reader Includes bibliographical references (s. 43-45) The original gray code -- Other gray codes -- Variations on the theme -- Choosing 2-samples -- Listing rooted trees -- Random selection of trees -- Listing free trees -- Generating random graphs A survey of some of the work that has been done since the appearance of the second edition of Combinatorial Algorithms. Topics include progress in: Gray Codes, listing of subsets of given size of a given universe, listing rooted and free trees, selecting free trees and unlabeled graphs uniformly at random, and ranking and unranking problems on unlabeled trees Update ed. of: Combinatorial algorithms for computers and calculators / Albert Nijenhuis and Herbert S. Wilf. 2nd ed. 1978. - Based on a series of 10 lectures given at the CBMS-NSF Conference on Selection Algorithms for Combinatorial Objects, held in the summer of 1987 at the Baca Grande campus of Colorado College Combinatorial analysis Algorithms Abzählende Kombinatorik (DE-588)4132720-2 gnd rswk-swf Algorithmus (DE-588)4001183-5 gnd rswk-swf Kombinatorische Analysis (DE-588)4164746-4 gnd rswk-swf Kombinatorik (DE-588)4031824-2 gnd rswk-swf Abzählende Kombinatorik (DE-588)4132720-2 s Algorithmus (DE-588)4001183-5 s DE-604 Kombinatorische Analysis (DE-588)4164746-4 s 1\p DE-604 Kombinatorik (DE-588)4031824-2 s 2\p DE-604 Erscheint auch als Druck-Ausgabe, Paperback 0898712319 Erscheint auch als Druck-Ausgabe, Paperback 9780898712315 CBMS-NSF regional conference series in applied mathematics 55 (DE-604)BV046682627 55 https://doi.org/10.1137/1.9781611970166 Verlag URL des Erstveröffentlichers Volltext 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 |
spellingShingle | Wilf, Herbert S. 1931-2012 Combinatorial algorithms an update CBMS-NSF regional conference series in applied mathematics Combinatorial analysis Algorithms Abzählende Kombinatorik (DE-588)4132720-2 gnd Algorithmus (DE-588)4001183-5 gnd Kombinatorische Analysis (DE-588)4164746-4 gnd Kombinatorik (DE-588)4031824-2 gnd |
subject_GND | (DE-588)4132720-2 (DE-588)4001183-5 (DE-588)4164746-4 (DE-588)4031824-2 |
title | Combinatorial algorithms an update |
title_auth | Combinatorial algorithms an update |
title_exact_search | Combinatorial algorithms an update |
title_full | Combinatorial algorithms an update Herbert S. Wilf |
title_fullStr | Combinatorial algorithms an update Herbert S. Wilf |
title_full_unstemmed | Combinatorial algorithms an update Herbert S. Wilf |
title_short | Combinatorial algorithms |
title_sort | combinatorial algorithms an update |
title_sub | an update |
topic | Combinatorial analysis Algorithms Abzählende Kombinatorik (DE-588)4132720-2 gnd Algorithmus (DE-588)4001183-5 gnd Kombinatorische Analysis (DE-588)4164746-4 gnd Kombinatorik (DE-588)4031824-2 gnd |
topic_facet | Combinatorial analysis Algorithms Abzählende Kombinatorik Algorithmus Kombinatorische Analysis Kombinatorik |
url | https://doi.org/10.1137/1.9781611970166 |
volume_link | (DE-604)BV046682627 |
work_keys_str_mv | AT wilfherberts combinatorialalgorithmsanupdate |