253 search results - page 6 / 51 » Edge and Node Searching Problems on Trees |
IFIP
2004
Springer
15 years 3 months ago
2004
Springer
We consider the problem of computing the optimal swap edges of a shortest-path tree. This theoretical problem arises in practice in systems that offer point-offailure shortest-path...
COCOON
2006
Springer
15 years 1 months ago
2006
Springer
We consider the problems of straightening polygonal trees and convexifying polygons by continuous motions such that rigid edges can rotate around vertex joints and no edge crossing...
FOCS
2006
IEEE
15 years 3 months ago
2006
IEEE
We extend the binary search technique to searching in trees. We consider two models of queries: questions about vertices and questions about edges. We present a general approach t...
141
click to vote
PODC
2011
ACM
14 years 16 days ago
2011
ACM
A maximal independent set on a graph is an inclusion-maximal set of mutually non-adjacent nodes. This basic symmetry breaking structure is vital for many distributed algorithms, w...
120
click to vote
EOR
2007
14 years 9 months ago
2007
The two-dimensional orthogonal non-guillotine cutting problem (NGCP) appears in many industries (like wood and steel industries) and consists in cutting a rectangular master surfa...