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)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2011
2011
This paper proposes a novel Linear Programming (LP) based algorithm, called Dynamic Tree-Block Coordinate Ascent (DT-BCA), for… 
2011
2011
In this paper, a video streaming system running on multicast tree for peer to peer networks is presented and dynamic tree… 
2008
2008
The dynamic tree problem is that of maintaining an arbitrary n-vertex forest that changes over time through edge insertions… 
2008
2008
This paper proposes a prefix-tree structure, called CPS-tree (Compact Pattern Stream tree) that efficiently discovers the exact… 
2007
2007
The peer-to-peer content distribution network (PCDN) is a hot topic recently, and it has a huge potential for massive data… 
2002
2002
Mechanisms that ensure mutual access, replication and resilience to failures in large distributed systems can be based on quorum… 
2002
2002
The problem of super-resolution involves generating feasible higher resolution images, which are pleasing to the eye and… 
2000
2000
We show how to maintain centers and medians for a collection of dynamic trees where edges may be inserted and deleted and node… 
Highly Cited
1998
Highly Cited
1998
This paper describes TRAM, a scalable reliable multicast transport protocol. TRAM is designed to support bulk data transfer with… 
1995
1995
Problems with dynamic tree-structured behavior are usually highly irregular with respect to the shape of potential processes…