Optimal algorithms for finding nearest common ancestors in dynamic trees:
Abstract: "We consider the problem of finding the nearest common ancestor of two given nodes x and y (denoted by nca(x, y)) in a collection of dynamic rooted trees. Interspersed with the nca queries are on-line commands link(x, y) where x but not necessarily y is a tree root. The effect of a co...
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Kobenhavn
1995
|
| Schriftenreihe: | Datalogisk Institut <København>: DIKU-Rapport
1995,30 |
| Schlagworte: | |
| Zusammenfassung: | Abstract: "We consider the problem of finding the nearest common ancestor of two given nodes x and y (denoted by nca(x, y)) in a collection of dynamic rooted trees. Interspersed with the nca queries are on-line commands link(x, y) where x but not necessarily y is a tree root. The effect of a command link(x, y) is to combine the trees containing x and y by making y the parent of x. We present an optimal pointer machine algorithm which performs n link and m nca in time O(n + mloglogn)." |
| Beschreibung: | 13 S. |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV011046460 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | t | ||
| 008 | 961108s1995 |||| 00||| engod | ||
| 035 | |a (OCoLC)38525447 | ||
| 035 | |a (DE-599)BVBBV011046460 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-91G | ||
| 100 | 1 | |a Alstrup, Stephen |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Optimal algorithms for finding nearest common ancestors in dynamic trees |c Stephen Alstrup |
| 264 | 1 | |a Kobenhavn |c 1995 | |
| 300 | |a 13 S. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a Datalogisk Institut <København>: DIKU-Rapport |v 1995,30 | |
| 520 | 3 | |a Abstract: "We consider the problem of finding the nearest common ancestor of two given nodes x and y (denoted by nca(x, y)) in a collection of dynamic rooted trees. Interspersed with the nca queries are on-line commands link(x, y) where x but not necessarily y is a tree root. The effect of a command link(x, y) is to combine the trees containing x and y by making y the parent of x. We present an optimal pointer machine algorithm which performs n link and m nca in time O(n + mloglogn)." | |
| 650 | 4 | |a Computational complexity | |
| 650 | 4 | |a Computer algorithms | |
| 650 | 4 | |a Trees (Graph theory) | |
| 830 | 0 | |a Datalogisk Institut <København>: DIKU-Rapport |v 1995,30 |w (DE-604)BV010011493 |9 1995,30 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-007397392 | ||
Datensatz im Suchindex
| _version_ | 1804125536245514240 |
|---|---|
| any_adam_object | |
| author | Alstrup, Stephen |
| author_facet | Alstrup, Stephen |
| author_role | aut |
| author_sort | Alstrup, Stephen |
| author_variant | s a sa |
| building | Verbundindex |
| bvnumber | BV011046460 |
| ctrlnum | (OCoLC)38525447 (DE-599)BVBBV011046460 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01462nam a2200313 cb4500</leader><controlfield tag="001">BV011046460</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">961108s1995 |||| 00||| engod</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)38525447</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV011046460</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-91G</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Alstrup, Stephen</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Optimal algorithms for finding nearest common ancestors in dynamic trees</subfield><subfield code="c">Stephen Alstrup</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Kobenhavn</subfield><subfield code="c">1995</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">13 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">Datalogisk Institut <København>: DIKU-Rapport</subfield><subfield code="v">1995,30</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "We consider the problem of finding the nearest common ancestor of two given nodes x and y (denoted by nca(x, y)) in a collection of dynamic rooted trees. Interspersed with the nca queries are on-line commands link(x, y) where x but not necessarily y is a tree root. The effect of a command link(x, y) is to combine the trees containing x and y by making y the parent of x. We present an optimal pointer machine algorithm which performs n link and m nca in time O(n + mloglogn)."</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computational complexity</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computer algorithms</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Trees (Graph theory)</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">Datalogisk Institut <København>: DIKU-Rapport</subfield><subfield code="v">1995,30</subfield><subfield code="w">(DE-604)BV010011493</subfield><subfield code="9">1995,30</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-007397392</subfield></datafield></record></collection> |
| id | DE-604.BV011046460 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T18:03:07Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-007397392 |
| oclc_num | 38525447 |
| open_access_boolean | |
| owner | DE-91G DE-BY-TUM |
| owner_facet | DE-91G DE-BY-TUM |
| physical | 13 S. |
| publishDate | 1995 |
| publishDateSearch | 1995 |
| publishDateSort | 1995 |
| record_format | marc |
| series | Datalogisk Institut <København>: DIKU-Rapport |
| series2 | Datalogisk Institut <København>: DIKU-Rapport |
| spelling | Alstrup, Stephen Verfasser aut Optimal algorithms for finding nearest common ancestors in dynamic trees Stephen Alstrup Kobenhavn 1995 13 S. txt rdacontent n rdamedia nc rdacarrier Datalogisk Institut <København>: DIKU-Rapport 1995,30 Abstract: "We consider the problem of finding the nearest common ancestor of two given nodes x and y (denoted by nca(x, y)) in a collection of dynamic rooted trees. Interspersed with the nca queries are on-line commands link(x, y) where x but not necessarily y is a tree root. The effect of a command link(x, y) is to combine the trees containing x and y by making y the parent of x. We present an optimal pointer machine algorithm which performs n link and m nca in time O(n + mloglogn)." Computational complexity Computer algorithms Trees (Graph theory) Datalogisk Institut <København>: DIKU-Rapport 1995,30 (DE-604)BV010011493 1995,30 |
| spellingShingle | Alstrup, Stephen Optimal algorithms for finding nearest common ancestors in dynamic trees Datalogisk Institut <København>: DIKU-Rapport Computational complexity Computer algorithms Trees (Graph theory) |
| title | Optimal algorithms for finding nearest common ancestors in dynamic trees |
| title_auth | Optimal algorithms for finding nearest common ancestors in dynamic trees |
| title_exact_search | Optimal algorithms for finding nearest common ancestors in dynamic trees |
| title_full | Optimal algorithms for finding nearest common ancestors in dynamic trees Stephen Alstrup |
| title_fullStr | Optimal algorithms for finding nearest common ancestors in dynamic trees Stephen Alstrup |
| title_full_unstemmed | Optimal algorithms for finding nearest common ancestors in dynamic trees Stephen Alstrup |
| title_short | Optimal algorithms for finding nearest common ancestors in dynamic trees |
| title_sort | optimal algorithms for finding nearest common ancestors in dynamic trees |
| topic | Computational complexity Computer algorithms Trees (Graph theory) |
| topic_facet | Computational complexity Computer algorithms Trees (Graph theory) |
| volume_link | (DE-604)BV010011493 |
| work_keys_str_mv | AT alstrupstephen optimalalgorithmsforfindingnearestcommonancestorsindynamictrees |