Skip to search formSkip to main contentSkip to account menu

Link/cut tree

Known as: Link cut tree, Link-cut tree, Dynamic tree 
A link/cut tree is a data structure for representing a forest, a set of rooted trees, and offers the following operations: * Add a tree consisting of… 
Wikipedia (opens in a new tab)

Related topics

Related topics

11 relations
Amortized analysisData structureDinic's algorithmDynamic connectivity

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2009
2009
VQ indexes compression and information hiding using hybrid lossless index coding
2008
2008
Dynamic Trees
The dynamic tree problem is that of maintaining an arbitrary n-vertex forest that changes over time through edge insertions… 
2008
2008
Efficient frequent pattern mining over data streams
This paper proposes a prefix-tree structure, called CPS-tree (Compact Pattern Stream tree) that efficiently discovers the exact… 
Highly Cited
2008
Highly Cited
2008
CP-Tree: A Tree Structure for Single-Pass Frequent Pattern Mining
FP-growth algorithm using FP-tree has been widely studied for frequent pattern mining because it can give a great performance… 
2007
2007
Novel Data Management Algorithms in Peer-to-Peer Content Distribution Networks
The peer-to-peer content distribution network (PCDN) is a hot topic recently, and it has a huge potential for massive data… 
2002
2002
Dynamic Structure Super-Resolution
The problem of super-resolution involves generating feasible higher resolution images, which are pleasing to the eye and… 
2001
2001
Parallel alpha-beta search on shared memory multiprocessors
Parallel Alpha-Beta Search on Shared Memory Multiprocessors Valavan Manohararajah Master of Applied Science Graduate Department… 
2001
2001
Competitive on-line stream merging algorithms for media-on-demand
Highly Cited
1998
Highly Cited
1998
TRAM: A Tree-based Reliable Multicast Protocol
This paper describes TRAM, a scalable reliable multicast transport protocol. TRAM is designed to support bulk data transfer with… 
1996
1996
Optimal Pointer Algorithms for Finding Nearest Common Ancestors in Dynamic Trees
We consider the problem of finding the nearest common ancestor of two given nodes x and y (denoted by nca(x, y)) in a dynamic… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)