822 search results - page 2 / 165 » Descendants in Increasing Trees |
CORR
2008
Springer
14 years 11 months ago
2008
Springer
A path from s to t on a polyhedral terrain is descending if the height of a point p never increases while we move p along the path from s to t. No efficient algorithm is known to ...
116
click to vote
CORR
2007
Springer
14 years 11 months ago
2007
Springer
A path from s to t on a polyhedral terrain is descending if the height of a point p never increases while we move p along the path from s to t. No efficient algorithm is known to ...
JCT
2011
14 years 6 months ago
2011
The descendant set desc(α) of a vertex α in a digraph D is the set of vertices which can be reached by a directed path from α. A subdigraph of D is finitely generated if it is...
ICPR
2006
IEEE
16 years 23 days ago
2006
IEEE
As camera resolution increases, high-speed non-contact text capture through a digital camera is opening up a new channel for document capture and understanding. Unfortunately, per...
DAM
2010
14 years 11 months ago
2010
We study the quantity distance between node j and node n in a random tree of size n for increasing tree families. We give closed formul