An algorithm for determining whether the connectivity of a graph is at least k:
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Buch |
| Sprache: | Undetermined |
| Veröffentlicht: |
Ithaca, New York
1973
|
| Schriftenreihe: | Cornell University <Ithaca, NY> / Department of Computer Science: Technical report
184 |
| Beschreibung: | 10 Bl. |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV009877579 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | t | ||
| 008 | 941104s1973 |||| 00||| undod | ||
| 035 | |a (OCoLC)634392122 | ||
| 035 | |a (DE-599)BVBBV009877579 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | |a und | ||
| 049 | |a DE-91G | ||
| 100 | 1 | |a Even, Shimon |d 1935-2004 |e Verfasser |0 (DE-588)110882695 |4 aut | |
| 245 | 1 | 0 | |a An algorithm for determining whether the connectivity of a graph is at least k |
| 264 | 1 | |a Ithaca, New York |c 1973 | |
| 300 | |a 10 Bl. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a Cornell University <Ithaca, NY> / Department of Computer Science: Technical report |v 184 | |
| 810 | 2 | |a Department of Computer Science: Technical report |t Cornell University <Ithaca, NY> |v 184 |w (DE-604)BV006185504 |9 184 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-006542318 | ||
Datensatz im Suchindex
| _version_ | 1804124237987840000 |
|---|---|
| any_adam_object | |
| author | Even, Shimon 1935-2004 |
| author_GND | (DE-588)110882695 |
| author_facet | Even, Shimon 1935-2004 |
| author_role | aut |
| author_sort | Even, Shimon 1935-2004 |
| author_variant | s e se |
| building | Verbundindex |
| bvnumber | BV009877579 |
| ctrlnum | (OCoLC)634392122 (DE-599)BVBBV009877579 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>00929nam a2200265 cb4500</leader><controlfield tag="001">BV009877579</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">941104s1973 |||| 00||| undod</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)634392122</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV009877579</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-91G</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Even, Shimon</subfield><subfield code="d">1935-2004</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)110882695</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">An algorithm for determining whether the connectivity of a graph is at least k</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Ithaca, New York</subfield><subfield code="c">1973</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">10 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">Cornell University <Ithaca, NY> / Department of Computer Science: Technical report</subfield><subfield code="v">184</subfield></datafield><datafield tag="810" ind1="2" ind2=" "><subfield code="a">Department of Computer Science: Technical report</subfield><subfield code="t">Cornell University <Ithaca, NY></subfield><subfield code="v">184</subfield><subfield code="w">(DE-604)BV006185504</subfield><subfield code="9">184</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-006542318</subfield></datafield></record></collection> |
| id | DE-604.BV009877579 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T17:42:29Z |
| institution | BVB |
| language | Undetermined |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-006542318 |
| oclc_num | 634392122 |
| open_access_boolean | |
| owner | DE-91G DE-BY-TUM |
| owner_facet | DE-91G DE-BY-TUM |
| physical | 10 Bl. |
| publishDate | 1973 |
| publishDateSearch | 1973 |
| publishDateSort | 1973 |
| record_format | marc |
| series2 | Cornell University <Ithaca, NY> / Department of Computer Science: Technical report |
| spelling | Even, Shimon 1935-2004 Verfasser (DE-588)110882695 aut An algorithm for determining whether the connectivity of a graph is at least k Ithaca, New York 1973 10 Bl. txt rdacontent n rdamedia nc rdacarrier Cornell University <Ithaca, NY> / Department of Computer Science: Technical report 184 Department of Computer Science: Technical report Cornell University <Ithaca, NY> 184 (DE-604)BV006185504 184 |
| spellingShingle | Even, Shimon 1935-2004 An algorithm for determining whether the connectivity of a graph is at least k |
| title | An algorithm for determining whether the connectivity of a graph is at least k |
| title_auth | An algorithm for determining whether the connectivity of a graph is at least k |
| title_exact_search | An algorithm for determining whether the connectivity of a graph is at least k |
| title_full | An algorithm for determining whether the connectivity of a graph is at least k |
| title_fullStr | An algorithm for determining whether the connectivity of a graph is at least k |
| title_full_unstemmed | An algorithm for determining whether the connectivity of a graph is at least k |
| title_short | An algorithm for determining whether the connectivity of a graph is at least k |
| title_sort | an algorithm for determining whether the connectivity of a graph is at least k |
| volume_link | (DE-604)BV006185504 |
| work_keys_str_mv | AT evenshimon analgorithmfordeterminingwhethertheconnectivityofagraphisatleastk |