1729 search results - page 230 / 346 » On Bounds for the k-Partitioning of Graphs |
158
click to vote
COMBINATORICS
2006
15 years 6 months ago
2006
We consider the problem of permutation reconstruction, which is a variant of graph reconstruction. Given a permutation p of length n, we delete k of its entries in each possible w...
155
click to vote
DEDS
2006
15 years 6 months ago
2006
In this paper, we propose a method for building the state class graph of a bounded time Petri net (TPN) as a timed automaton (TA), which we call the state class timed automaton. We...
198
click to vote
ECCV
2008
Springer
16 years 8 months ago
2008
Springer
Efficient global optimization techniques such as graph cut exist for energies corresponding to binary image segmentation from lowlevel cues. However, introducing a high-level prior...
171
click to vote
DCOSS
2009
Springer
15 years 11 months ago
2009
Springer
Abstract. In this paper we present local distributed algorithms for constructing spanners in wireless sensor networks modeled as unit ball graphs (shortly UBGs) and quasi-unit ball...
169
click to vote
ICPP
1991
IEEE
15 years 10 months ago
1991
IEEE
There is an interesting class of ICNs, which includes the star graph and the n-way shuffle, for which the network diameter is sub-logarithmic in the network size. This paper prese...