Two linear-time algorithms for five-coloring a planar graph:
Gespeichert in:
| Hauptverfasser: | , , |
|---|---|
| Format: | Mikrofilm Buch |
| Sprache: | English |
| Veröffentlicht: |
Stanford, Calif.
1980
|
| Schriftenreihe: | Stanford University / Computer Science Department: Report STAN-CS
830 |
| Schlagworte: | |
| Beschreibung: | Mikroreprod. e. Ms. 23 S. |
| Beschreibung: | 1 Mikrofiche 24x |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV009241147 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | he|uuuuuuuuuu | ||
| 008 | 940313s1980 |||| b|||| 00||| eng d | ||
| 035 | |a (OCoLC)42721238 | ||
| 035 | |a (DE-599)BVBBV009241147 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-29T | ||
| 050 | 0 | |a QA76 | |
| 100 | 1 | |a Matula, David |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Two linear-time algorithms for five-coloring a planar graph |c by David Matula ; Yossi Shiloach ; Robert Tarjan |
| 264 | 1 | |a Stanford, Calif. |c 1980 | |
| 300 | |a 1 Mikrofiche |b 24x | ||
| 337 | |b h |2 rdamedia | ||
| 338 | |b he |2 rdacarrier | ||
| 490 | 1 | |a Stanford University / Computer Science Department: Report STAN-CS |v 830 | |
| 500 | |a Mikroreprod. e. Ms. 23 S. | ||
| 650 | 4 | |a Algorithms | |
| 650 | 4 | |a Color | |
| 650 | 4 | |a Computer graphics | |
| 650 | 4 | |a Graph theory | |
| 650 | 4 | |a Graphic methods | |
| 700 | 1 | |a Shiloach, Yossi |e Verfasser |4 aut | |
| 700 | 1 | |a Tarjan, Robert E. |e Verfasser |4 aut | |
| 810 | 2 | |a Computer Science Department: Report STAN-CS |t Stanford University |v 830 |w (DE-604)BV008928280 |9 830 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-006147975 | ||
Datensatz im Suchindex
| _version_ | 1804123687367999488 |
|---|---|
| any_adam_object | |
| author | Matula, David Shiloach, Yossi Tarjan, Robert E. |
| author_facet | Matula, David Shiloach, Yossi Tarjan, Robert E. |
| author_role | aut aut aut |
| author_sort | Matula, David |
| author_variant | d m dm y s ys r e t re ret |
| building | Verbundindex |
| bvnumber | BV009241147 |
| callnumber-first | Q - Science |
| callnumber-label | QA76 |
| callnumber-raw | QA76 |
| callnumber-search | QA76 |
| callnumber-sort | QA 276 |
| callnumber-subject | QA - Mathematics |
| ctrlnum | (OCoLC)42721238 (DE-599)BVBBV009241147 |
| format | Microfilm Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01188nam a2200361 cb4500</leader><controlfield tag="001">BV009241147</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">he|uuuuuuuuuu</controlfield><controlfield tag="008">940313s1980 |||| b|||| 00||| eng d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)42721238</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV009241147</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</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Matula, David</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Two linear-time algorithms for five-coloring a planar graph</subfield><subfield code="c">by David Matula ; Yossi Shiloach ; Robert Tarjan</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Stanford, Calif.</subfield><subfield code="c">1980</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 Mikrofiche</subfield><subfield code="b">24x</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">h</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">he</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="490" ind1="1" ind2=" "><subfield code="a">Stanford University / Computer Science Department: Report STAN-CS</subfield><subfield code="v">830</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">Mikroreprod. e. Ms. 23 S.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Algorithms</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Color</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computer graphics</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Graph theory</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Graphic methods</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Shiloach, Yossi</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Tarjan, Robert E.</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="810" ind1="2" ind2=" "><subfield code="a">Computer Science Department: Report STAN-CS</subfield><subfield code="t">Stanford University</subfield><subfield code="v">830</subfield><subfield code="w">(DE-604)BV008928280</subfield><subfield code="9">830</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-006147975</subfield></datafield></record></collection> |
| id | DE-604.BV009241147 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T17:33:44Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-006147975 |
| oclc_num | 42721238 |
| open_access_boolean | |
| owner | DE-29T |
| owner_facet | DE-29T |
| physical | 1 Mikrofiche 24x |
| publishDate | 1980 |
| publishDateSearch | 1980 |
| publishDateSort | 1980 |
| record_format | marc |
| series2 | Stanford University / Computer Science Department: Report STAN-CS |
| spelling | Matula, David Verfasser aut Two linear-time algorithms for five-coloring a planar graph by David Matula ; Yossi Shiloach ; Robert Tarjan Stanford, Calif. 1980 1 Mikrofiche 24x h rdamedia he rdacarrier Stanford University / Computer Science Department: Report STAN-CS 830 Mikroreprod. e. Ms. 23 S. Algorithms Color Computer graphics Graph theory Graphic methods Shiloach, Yossi Verfasser aut Tarjan, Robert E. Verfasser aut Computer Science Department: Report STAN-CS Stanford University 830 (DE-604)BV008928280 830 |
| spellingShingle | Matula, David Shiloach, Yossi Tarjan, Robert E. Two linear-time algorithms for five-coloring a planar graph Algorithms Color Computer graphics Graph theory Graphic methods |
| title | Two linear-time algorithms for five-coloring a planar graph |
| title_auth | Two linear-time algorithms for five-coloring a planar graph |
| title_exact_search | Two linear-time algorithms for five-coloring a planar graph |
| title_full | Two linear-time algorithms for five-coloring a planar graph by David Matula ; Yossi Shiloach ; Robert Tarjan |
| title_fullStr | Two linear-time algorithms for five-coloring a planar graph by David Matula ; Yossi Shiloach ; Robert Tarjan |
| title_full_unstemmed | Two linear-time algorithms for five-coloring a planar graph by David Matula ; Yossi Shiloach ; Robert Tarjan |
| title_short | Two linear-time algorithms for five-coloring a planar graph |
| title_sort | two linear time algorithms for five coloring a planar graph |
| topic | Algorithms Color Computer graphics Graph theory Graphic methods |
| topic_facet | Algorithms Color Computer graphics Graph theory Graphic methods |
| volume_link | (DE-604)BV008928280 |
| work_keys_str_mv | AT matuladavid twolineartimealgorithmsforfivecoloringaplanargraph AT shiloachyossi twolineartimealgorithmsforfivecoloringaplanargraph AT tarjanroberte twolineartimealgorithmsforfivecoloringaplanargraph |