Decremental dynamic connectivity:
Abstract: "We consider Las Vegas randomized dynamic algorithms for on-line connectivity problems with deletions only. In particular, we show that starting from a graph with m edges and n nodes, we can maintain a spanning forest during m deletions in O(min[n², m log n] + [square root of (nm)]log...
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Kbenhavn
1996
|
| Schriftenreihe: | Datalogisk Institut <København>: DIKU-Rapport
1996,9 |
| Schlagworte: | |
| Zusammenfassung: | Abstract: "We consider Las Vegas randomized dynamic algorithms for on-line connectivity problems with deletions only. In particular, we show that starting from a graph with m edges and n nodes, we can maintain a spanning forest during m deletions in O(min[n², m log n] + [square root of (nm)]log[superscript 2.5]n) expected total time. This is amortized constant time per operation if we start with a complete graph. The deletions may be interspersed with connectivity queries, each of which is answered in constant time. The previous best bound was O(m log² n) by Henzinger and Thorup (1996), which covered both insertions and deletions. Our bound is stronger for m/n = w(log n). The result is based on a general randomized reduction of many deletions-only queries to few deletions and insertions queries. Similar results are thus derived for 2-edge- connectivity, bipartiteness, and q-weights minimum spanning tree. For the decremental dynamic k-edge-connectivity problem of deleting the edges of a graph starting with m edges and n nodes, we get a total running time of O(k²n²polylog n). The previous best bound was O(kmnpolylog n). Also improved running times are achieved for the static consensus tree problem, with applications to computational biology and relational data bases." |
| Beschreibung: | 15 S. |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV011072146 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | t | ||
| 008 | 961121s1996 |||| 00||| engod | ||
| 035 | |a (OCoLC)38963461 | ||
| 035 | |a (DE-599)BVBBV011072146 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-91G | ||
| 100 | 1 | |a Thorup, Mikkel |d 1973- |e Verfasser |0 (DE-588)1044557877 |4 aut | |
| 245 | 1 | 0 | |a Decremental dynamic connectivity |c Mikkel Thorup |
| 264 | 1 | |a Kbenhavn |c 1996 | |
| 300 | |a 15 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 1996,9 | |
| 520 | 3 | |a Abstract: "We consider Las Vegas randomized dynamic algorithms for on-line connectivity problems with deletions only. In particular, we show that starting from a graph with m edges and n nodes, we can maintain a spanning forest during m deletions in O(min[n², m log n] + [square root of (nm)]log[superscript 2.5]n) expected total time. This is amortized constant time per operation if we start with a complete graph. The deletions may be interspersed with connectivity queries, each of which is answered in constant time. The previous best bound was O(m log² n) by Henzinger and Thorup (1996), which covered both insertions and deletions. Our bound is stronger for m/n = w(log n). The result is based on a general randomized reduction of many deletions-only queries to few deletions and insertions queries. Similar results are thus derived for 2-edge- connectivity, bipartiteness, and q-weights minimum spanning tree. For the decremental dynamic k-edge-connectivity problem of deleting the edges of a graph starting with m edges and n nodes, we get a total running time of O(k²n²polylog n). The previous best bound was O(kmnpolylog n). Also improved running times are achieved for the static consensus tree problem, with applications to computational biology and relational data bases." | |
| 650 | 4 | |a Datenverarbeitung | |
| 650 | 4 | |a Biology |x Data processing | |
| 650 | 4 | |a Computer algorithms | |
| 650 | 4 | |a Graph theory | |
| 650 | 4 | |a Relational databases | |
| 830 | 0 | |a Datalogisk Institut <København>: DIKU-Rapport |v 1996,9 |w (DE-604)BV010011493 |9 1996,9 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-007416540 | ||
Datensatz im Suchindex
| _version_ | 1804125562325696512 |
|---|---|
| any_adam_object | |
| author | Thorup, Mikkel 1973- |
| author_GND | (DE-588)1044557877 |
| author_facet | Thorup, Mikkel 1973- |
| author_role | aut |
| author_sort | Thorup, Mikkel 1973- |
| author_variant | m t mt |
| building | Verbundindex |
| bvnumber | BV011072146 |
| ctrlnum | (OCoLC)38963461 (DE-599)BVBBV011072146 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02305nam a2200337 cb4500</leader><controlfield tag="001">BV011072146</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">961121s1996 |||| 00||| engod</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)38963461</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV011072146</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">Thorup, Mikkel</subfield><subfield code="d">1973-</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)1044557877</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Decremental dynamic connectivity</subfield><subfield code="c">Mikkel Thorup</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Kbenhavn</subfield><subfield code="c">1996</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">15 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">1996,9</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "We consider Las Vegas randomized dynamic algorithms for on-line connectivity problems with deletions only. In particular, we show that starting from a graph with m edges and n nodes, we can maintain a spanning forest during m deletions in O(min[n², m log n] + [square root of (nm)]log[superscript 2.5]n) expected total time. This is amortized constant time per operation if we start with a complete graph. The deletions may be interspersed with connectivity queries, each of which is answered in constant time. The previous best bound was O(m log² n) by Henzinger and Thorup (1996), which covered both insertions and deletions. Our bound is stronger for m/n = w(log n). The result is based on a general randomized reduction of many deletions-only queries to few deletions and insertions queries. Similar results are thus derived for 2-edge- connectivity, bipartiteness, and q-weights minimum spanning tree. For the decremental dynamic k-edge-connectivity problem of deleting the edges of a graph starting with m edges and n nodes, we get a total running time of O(k²n²polylog n). The previous best bound was O(kmnpolylog n). Also improved running times are achieved for the static consensus tree problem, with applications to computational biology and relational data bases."</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Datenverarbeitung</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Biology</subfield><subfield code="x">Data processing</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computer algorithms</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Graph theory</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Relational databases</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">Datalogisk Institut <København>: DIKU-Rapport</subfield><subfield code="v">1996,9</subfield><subfield code="w">(DE-604)BV010011493</subfield><subfield code="9">1996,9</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-007416540</subfield></datafield></record></collection> |
| id | DE-604.BV011072146 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T18:03:32Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-007416540 |
| oclc_num | 38963461 |
| open_access_boolean | |
| owner | DE-91G DE-BY-TUM |
| owner_facet | DE-91G DE-BY-TUM |
| physical | 15 S. |
| publishDate | 1996 |
| publishDateSearch | 1996 |
| publishDateSort | 1996 |
| record_format | marc |
| series | Datalogisk Institut <København>: DIKU-Rapport |
| series2 | Datalogisk Institut <København>: DIKU-Rapport |
| spelling | Thorup, Mikkel 1973- Verfasser (DE-588)1044557877 aut Decremental dynamic connectivity Mikkel Thorup Kbenhavn 1996 15 S. txt rdacontent n rdamedia nc rdacarrier Datalogisk Institut <København>: DIKU-Rapport 1996,9 Abstract: "We consider Las Vegas randomized dynamic algorithms for on-line connectivity problems with deletions only. In particular, we show that starting from a graph with m edges and n nodes, we can maintain a spanning forest during m deletions in O(min[n², m log n] + [square root of (nm)]log[superscript 2.5]n) expected total time. This is amortized constant time per operation if we start with a complete graph. The deletions may be interspersed with connectivity queries, each of which is answered in constant time. The previous best bound was O(m log² n) by Henzinger and Thorup (1996), which covered both insertions and deletions. Our bound is stronger for m/n = w(log n). The result is based on a general randomized reduction of many deletions-only queries to few deletions and insertions queries. Similar results are thus derived for 2-edge- connectivity, bipartiteness, and q-weights minimum spanning tree. For the decremental dynamic k-edge-connectivity problem of deleting the edges of a graph starting with m edges and n nodes, we get a total running time of O(k²n²polylog n). The previous best bound was O(kmnpolylog n). Also improved running times are achieved for the static consensus tree problem, with applications to computational biology and relational data bases." Datenverarbeitung Biology Data processing Computer algorithms Graph theory Relational databases Datalogisk Institut <København>: DIKU-Rapport 1996,9 (DE-604)BV010011493 1996,9 |
| spellingShingle | Thorup, Mikkel 1973- Decremental dynamic connectivity Datalogisk Institut <København>: DIKU-Rapport Datenverarbeitung Biology Data processing Computer algorithms Graph theory Relational databases |
| title | Decremental dynamic connectivity |
| title_auth | Decremental dynamic connectivity |
| title_exact_search | Decremental dynamic connectivity |
| title_full | Decremental dynamic connectivity Mikkel Thorup |
| title_fullStr | Decremental dynamic connectivity Mikkel Thorup |
| title_full_unstemmed | Decremental dynamic connectivity Mikkel Thorup |
| title_short | Decremental dynamic connectivity |
| title_sort | decremental dynamic connectivity |
| topic | Datenverarbeitung Biology Data processing Computer algorithms Graph theory Relational databases |
| topic_facet | Datenverarbeitung Biology Data processing Computer algorithms Graph theory Relational databases |
| volume_link | (DE-604)BV010011493 |
| work_keys_str_mv | AT thorupmikkel decrementaldynamicconnectivity |