6740 search results - page 986 / 1348 » An s -Hamiltonian Line Graph Problem |
185
click to vote
PDPTA
2003
15 years 8 months ago
2003
In this paper, we study the coloring problem for the undirected binary de Bruijn interconnection network. The coloring scheme is simple and fast. We propose the coloring algorithm...
192
click to vote
SODA
1998
ACM
15 years 8 months ago
1998
ACM
We introduce a new set of probabilistic analysis tools based on the analysis of And-Or trees with random inputs. These tools provide a unifying, intuitive, and powerful framework ...
182
click to vote
CCCG
2009
15 years 8 months ago
2009
We study a maximum flow problem in a polygonal domain P: Determine the maximum number of disjoint "thick" paths (of specified width w) through P from a source edge to a ...
181
click to vote
GLOBECOM
2008
IEEE
15 years 8 months ago
2008
IEEE
—Conflict free spectrum allocation for secondary users in cognitive networks is a challenging problem, since the accessible spectrum is shared among users. The problem becomes to...
171
click to vote
ICASSP
2010
IEEE
15 years 7 months ago
2010
IEEE
This paper addresses the problem of the interpolation of 2-d spherical signals from non-uniformly sampled and noisy data. We propose a graph-based regularization algorithm to impr...