220 search results - page 8 / 44 » Reconstruction Algorithm for Permutation Graphs |
TCS
2002
13 years 7 months ago
2002
Oblivious permutation routing in binary d-cubes has been well studied in the literature. In a permutation routing, each node initially contains a packet with a destination such th...
WG
2005
Springer
14 years 1 months ago
2005
Springer
Partitive set families are families of sets that can be quite large, but have a compact, recursive representation in the form of a tree. This tree is a common generalization of PQ...
SODA
2010
ACM
14 years 5 months ago
2010
ACM
There has been great interest in deciding whether a combinatorial structure satisfies some property, or in estimating the value of some numerical function associated with this com...
CPM
2001
Springer
14 years 1 days ago
2001
Springer
In 1995, Hannenhalli and Pevzner gave a first polynomial solution to the problem of finding the minimum number of reversals needed to sort a signed permutation.Their solution, a...
TIP
2008
13 years 7 months ago
2008
We introduce a graph Laplacian based algorithm for the tomography reconstruction of a planar object from its projections taken at random unknown directions. The algorithm is shown ...