Generating random graphs efficiently:
Abstract: "We consider the algorithmic complexity of generating labeled (directed and undirected) graphs under various distributions. We describe three natural optimality criteria for graph generating algorithms, and show algorithms that are optimal for many distributions."
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Rochester, NY
1991
|
| Schriftenreihe: | University of Rochester <Rochester, NY> / Department of Computer Science: Technical report
369 |
| Schlagworte: | |
| Zusammenfassung: | Abstract: "We consider the algorithmic complexity of generating labeled (directed and undirected) graphs under various distributions. We describe three natural optimality criteria for graph generating algorithms, and show algorithms that are optimal for many distributions." |
| Beschreibung: | 9 Bl. |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV008974828 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | t | ||
| 008 | 940206s1991 |||| 00||| eng d | ||
| 035 | |a (OCoLC)24448762 | ||
| 035 | |a (DE-599)BVBBV008974828 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-29T | ||
| 100 | 1 | |a Raman, Rajeev |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Generating random graphs efficiently |c Rajeev Raman |
| 264 | 1 | |a Rochester, NY |c 1991 | |
| 300 | |a 9 Bl. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a University of Rochester <Rochester, NY> / Department of Computer Science: Technical report |v 369 | |
| 520 | 3 | |a Abstract: "We consider the algorithmic complexity of generating labeled (directed and undirected) graphs under various distributions. We describe three natural optimality criteria for graph generating algorithms, and show algorithms that are optimal for many distributions." | |
| 650 | 4 | |a Algorithms | |
| 650 | 4 | |a Computational complexity | |
| 810 | 2 | |a Department of Computer Science: Technical report |t University of Rochester <Rochester, NY> |v 369 |w (DE-604)BV008902697 |9 369 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-005926358 | ||
Datensatz im Suchindex
| _version_ | 1804123312913121280 |
|---|---|
| any_adam_object | |
| author | Raman, Rajeev |
| author_facet | Raman, Rajeev |
| author_role | aut |
| author_sort | Raman, Rajeev |
| author_variant | r r rr |
| building | Verbundindex |
| bvnumber | BV008974828 |
| ctrlnum | (OCoLC)24448762 (DE-599)BVBBV008974828 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01238nam a2200301 cb4500</leader><controlfield tag="001">BV008974828</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">940206s1991 |||| 00||| eng d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)24448762</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV008974828</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="100" ind1="1" ind2=" "><subfield code="a">Raman, Rajeev</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Generating random graphs efficiently</subfield><subfield code="c">Rajeev Raman</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Rochester, NY</subfield><subfield code="c">1991</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">9 Bl.</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">University of Rochester <Rochester, NY> / Department of Computer Science: Technical report</subfield><subfield code="v">369</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "We consider the algorithmic complexity of generating labeled (directed and undirected) graphs under various distributions. We describe three natural optimality criteria for graph generating algorithms, and show algorithms that are optimal for many distributions."</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Algorithms</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computational complexity</subfield></datafield><datafield tag="810" ind1="2" ind2=" "><subfield code="a">Department of Computer Science: Technical report</subfield><subfield code="t">University of Rochester <Rochester, NY></subfield><subfield code="v">369</subfield><subfield code="w">(DE-604)BV008902697</subfield><subfield code="9">369</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-005926358</subfield></datafield></record></collection> |
| id | DE-604.BV008974828 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T17:27:47Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-005926358 |
| oclc_num | 24448762 |
| open_access_boolean | |
| owner | DE-29T |
| owner_facet | DE-29T |
| physical | 9 Bl. |
| publishDate | 1991 |
| publishDateSearch | 1991 |
| publishDateSort | 1991 |
| record_format | marc |
| series2 | University of Rochester <Rochester, NY> / Department of Computer Science: Technical report |
| spelling | Raman, Rajeev Verfasser aut Generating random graphs efficiently Rajeev Raman Rochester, NY 1991 9 Bl. txt rdacontent n rdamedia nc rdacarrier University of Rochester <Rochester, NY> / Department of Computer Science: Technical report 369 Abstract: "We consider the algorithmic complexity of generating labeled (directed and undirected) graphs under various distributions. We describe three natural optimality criteria for graph generating algorithms, and show algorithms that are optimal for many distributions." Algorithms Computational complexity Department of Computer Science: Technical report University of Rochester <Rochester, NY> 369 (DE-604)BV008902697 369 |
| spellingShingle | Raman, Rajeev Generating random graphs efficiently Algorithms Computational complexity |
| title | Generating random graphs efficiently |
| title_auth | Generating random graphs efficiently |
| title_exact_search | Generating random graphs efficiently |
| title_full | Generating random graphs efficiently Rajeev Raman |
| title_fullStr | Generating random graphs efficiently Rajeev Raman |
| title_full_unstemmed | Generating random graphs efficiently Rajeev Raman |
| title_short | Generating random graphs efficiently |
| title_sort | generating random graphs efficiently |
| topic | Algorithms Computational complexity |
| topic_facet | Algorithms Computational complexity |
| volume_link | (DE-604)BV008902697 |
| work_keys_str_mv | AT ramanrajeev generatingrandomgraphsefficiently |