Disjoint-set data structure

Results: 30



#Item
1Optimized Union of Non-disjoint Distributed Data Sets Itay Dar Tova Milo  ∗

Optimized Union of Non-disjoint Distributed Data Sets Itay Dar Tova Milo ∗

Add to Reading List

Source URL: www.cs.tau.ac.il

Language: English - Date: 2008-09-25 05:48:21
2Data Min Knowl Disc:176–193 DOIs10618Identifying the components Matthijs van Leeuwen · Jilles Vreeken · Arno Siebes

Data Min Knowl Disc:176–193 DOIs10618Identifying the components Matthijs van Leeuwen · Jilles Vreeken · Arno Siebes

Add to Reading List

Source URL: eda.mmci.uni-saarland.de

Language: English - Date: 2011-01-03 06:17:50
3Worst-Case Analysis of Set Union Algorithms ROBERT E. TAR JAN AT&T Bell Laboratories, Murray Hdl, New Jersey AND JAN VAN LEEUWEN

Worst-Case Analysis of Set Union Algorithms ROBERT E. TAR JAN AT&T Bell Laboratories, Murray Hdl, New Jersey AND JAN VAN LEEUWEN

Add to Reading List

Source URL: bioinfo.ict.ac.cn

Language: English - Date: 2014-11-28 11:05:21
4Optimized Union of Non-disjoint Distributed Data Sets Itay Dar Tova Milo  ∗

Optimized Union of Non-disjoint Distributed Data Sets Itay Dar Tova Milo ∗

Add to Reading List

Source URL: www.mancoosi.org

Language: English - Date: 2012-12-16 04:54:55
5PROD. TYPE: COM PP: 1-12 (col.fig.: nil) ED: Prathiba PAGN: Vidya -- SCAN: global

PROD. TYPE: COM PP: 1-12 (col.fig.: nil) ED: Prathiba PAGN: Vidya -- SCAN: global

Add to Reading List

Source URL: www1.univ-ag.fr

Language: English - Date: 2004-12-31 11:43:37
6A faster parameterized algorithm for set packing Ioannis Koutis Computer Science Department Carnegie Mellon University Pittsburgh, PAUSA

A faster parameterized algorithm for set packing Ioannis Koutis Computer Science Department Carnegie Mellon University Pittsburgh, PAUSA

Add to Reading List

Source URL: ccom.uprrp.edu

Language: English - Date: 2011-03-02 23:58:37
7Actor Garbage Collection Using Vertex-Preserving Actor-to-Object Graph Transformations Wei-Jen Wang1 , Carlos Varela2 , Fu-Hau Hsu1 *, and Cheng-Hsien Tang1 1

Actor Garbage Collection Using Vertex-Preserving Actor-to-Object Graph Transformations Wei-Jen Wang1 , Carlos Varela2 , Fu-Hau Hsu1 *, and Cheng-Hsien Tang1 1

Add to Reading List

Source URL: wcl.cs.rpi.edu

Language: English - Date: 2015-01-22 12:32:36
8Algorithms  Lecture 17: Disjoint Sets [Fa’13] E pluribus unum (Out of many, one) — Official motto of the United States of America

Algorithms Lecture 17: Disjoint Sets [Fa’13] E pluribus unum (Out of many, one) — Official motto of the United States of America

Add to Reading List

Source URL: web.engr.illinois.edu

Language: English - Date: 2014-12-28 09:02:45
9COMS21103  Disjoint sets and minimum spanning trees Ashley Montanaro  Department of Computer Science, University of Bristol

COMS21103 Disjoint sets and minimum spanning trees Ashley Montanaro Department of Computer Science, University of Bristol

Add to Reading List

Source URL: www.cs.bris.ac.uk

Language: English - Date: 2014-01-08 09:09:08
10CS 157: Assignment 2 Douglas R. Lanman 27 February 2006 Problem 1: Union-Find with Deletions The union-find data structure, utilizing the “union-by-rank” and “path compression” heuristics, is

CS 157: Assignment 2 Douglas R. Lanman 27 February 2006 Problem 1: Union-Find with Deletions The union-find data structure, utilizing the “union-by-rank” and “path compression” heuristics, is

Add to Reading List

Source URL: mesh.brown.edu

Language: English - Date: 2006-02-27 14:13:36