Optimal parallel algorithms on sorted intervals:
Abstract: "We present O(log n) time, O(n/log n) processor EREW PRAM algorithms for finding a depth first search tree, a breadth first search tree, a maximum independent set, a minimum clique cover, a minimum dominating set, and a minimum coloring of an interval graph when a interval model is gi...
Saved in:
| Main Author: | |
|---|---|
| Format: | Book |
| Language: | English |
| Published: |
Seattle, Wash.
1990
|
| Series: | University of Washington <Seattle, Wash.> / Department of Computer Science: Technical report
90,1,4 |
| Subjects: | |
| Summary: | Abstract: "We present O(log n) time, O(n/log n) processor EREW PRAM algorithms for finding a depth first search tree, a breadth first search tree, a maximum independent set, a minimum clique cover, a minimum dominating set, and a minimum coloring of an interval graph when a interval model is given and the endpoints of the intervals are initially sorted by x-coordinates." |
| Physical Description: | 19 S. |
Staff View
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV009260377 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | t | ||
| 008 | 940313s1990 |||| 00||| eng d | ||
| 035 | |a (OCoLC)24448537 | ||
| 035 | |a (DE-599)BVBBV009260377 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-29T | ||
| 100 | 1 | |a Kim, Sung K. |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Optimal parallel algorithms on sorted intervals |c Sung Kwon Kim |
| 264 | 1 | |a Seattle, Wash. |c 1990 | |
| 300 | |a 19 S. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a University of Washington <Seattle, Wash.> / Department of Computer Science: Technical report |v 90,1,4 | |
| 520 | 3 | |a Abstract: "We present O(log n) time, O(n/log n) processor EREW PRAM algorithms for finding a depth first search tree, a breadth first search tree, a maximum independent set, a minimum clique cover, a minimum dominating set, and a minimum coloring of an interval graph when a interval model is given and the endpoints of the intervals are initially sorted by x-coordinates." | |
| 650 | 4 | |a Search theory | |
| 650 | 4 | |a Trees (Graph theory) | |
| 810 | 2 | |a Department of Computer Science: Technical report |t University of Washington <Seattle, Wash.> |v 90,1,4 |w (DE-604)BV008930431 |9 90,1,4 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-006162253 | ||
Record in the Search Index
| _version_ | 1804123708246196224 |
|---|---|
| any_adam_object | |
| author | Kim, Sung K. |
| author_facet | Kim, Sung K. |
| author_role | aut |
| author_sort | Kim, Sung K. |
| author_variant | s k k sk skk |
| building | Verbundindex |
| bvnumber | BV009260377 |
| ctrlnum | (OCoLC)24448537 (DE-599)BVBBV009260377 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01361nam a2200301 cb4500</leader><controlfield tag="001">BV009260377</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">940313s1990 |||| 00||| eng d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)24448537</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV009260377</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">Kim, Sung K.</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Optimal parallel algorithms on sorted intervals</subfield><subfield code="c">Sung Kwon Kim</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Seattle, Wash.</subfield><subfield code="c">1990</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">19 S.</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 Washington <Seattle, Wash.> / Department of Computer Science: Technical report</subfield><subfield code="v">90,1,4</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "We present O(log n) time, O(n/log n) processor EREW PRAM algorithms for finding a depth first search tree, a breadth first search tree, a maximum independent set, a minimum clique cover, a minimum dominating set, and a minimum coloring of an interval graph when a interval model is given and the endpoints of the intervals are initially sorted by x-coordinates."</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Search theory</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Trees (Graph theory)</subfield></datafield><datafield tag="810" ind1="2" ind2=" "><subfield code="a">Department of Computer Science: Technical report</subfield><subfield code="t">University of Washington <Seattle, Wash.></subfield><subfield code="v">90,1,4</subfield><subfield code="w">(DE-604)BV008930431</subfield><subfield code="9">90,1,4</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-006162253</subfield></datafield></record></collection> |
| id | DE-604.BV009260377 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T17:34:04Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-006162253 |
| oclc_num | 24448537 |
| open_access_boolean | |
| owner | DE-29T |
| owner_facet | DE-29T |
| physical | 19 S. |
| publishDate | 1990 |
| publishDateSearch | 1990 |
| publishDateSort | 1990 |
| record_format | marc |
| series2 | University of Washington <Seattle, Wash.> / Department of Computer Science: Technical report |
| spelling | Kim, Sung K. Verfasser aut Optimal parallel algorithms on sorted intervals Sung Kwon Kim Seattle, Wash. 1990 19 S. txt rdacontent n rdamedia nc rdacarrier University of Washington <Seattle, Wash.> / Department of Computer Science: Technical report 90,1,4 Abstract: "We present O(log n) time, O(n/log n) processor EREW PRAM algorithms for finding a depth first search tree, a breadth first search tree, a maximum independent set, a minimum clique cover, a minimum dominating set, and a minimum coloring of an interval graph when a interval model is given and the endpoints of the intervals are initially sorted by x-coordinates." Search theory Trees (Graph theory) Department of Computer Science: Technical report University of Washington <Seattle, Wash.> 90,1,4 (DE-604)BV008930431 90,1,4 |
| spellingShingle | Kim, Sung K. Optimal parallel algorithms on sorted intervals Search theory Trees (Graph theory) |
| title | Optimal parallel algorithms on sorted intervals |
| title_auth | Optimal parallel algorithms on sorted intervals |
| title_exact_search | Optimal parallel algorithms on sorted intervals |
| title_full | Optimal parallel algorithms on sorted intervals Sung Kwon Kim |
| title_fullStr | Optimal parallel algorithms on sorted intervals Sung Kwon Kim |
| title_full_unstemmed | Optimal parallel algorithms on sorted intervals Sung Kwon Kim |
| title_short | Optimal parallel algorithms on sorted intervals |
| title_sort | optimal parallel algorithms on sorted intervals |
| topic | Search theory Trees (Graph theory) |
| topic_facet | Search theory Trees (Graph theory) |
| volume_link | (DE-604)BV008930431 |
| work_keys_str_mv | AT kimsungk optimalparallelalgorithmsonsortedintervals |