796 search results - page 122 / 160 » The Anonymous Subgraph Problem |
108
click to vote
FOCS
2006
IEEE
15 years 6 months ago
2006
IEEE
We consider the minimum cost spanning tree problem under the restriction that all degrees must be at most a given value k. We show that we can efficiently find a spanning tree o...
LCTRTS
2005
Springer
15 years 5 months ago
2005
Springer
Dictionary compression mechanisms identify redundant sequences of instructions that occur in a program. The sequences are extracted and copied to a dictionary. Each sequence is th...
GD
2004
Springer
15 years 5 months ago
2004
Springer
Consider the following question: does every complete geometric graph K2n have a partition of its edge set into n plane spanning trees? We approach this problem from three directio...
113
click to vote
GG
2004
Springer
15 years 5 months ago
2004
Springer
Abstract. In the context of graph transformation we look at the operation of switching, which can be viewed as an elegant method for realizing global transformations of (group-labe...
106
click to vote
DCOSS
2006
Springer
15 years 3 months ago
2006
Springer
Abstract. We consider the problem of estimating vector-valued variables from noisy "relative" measurements. The measurement model can be expressed in terms of a graph, wh...