6740 search results - page 1032 / 1348 » An s -Hamiltonian Line Graph Problem |
178
click to vote
COMBINATORICS
2007
15 years 6 months ago
2007
Each m by m symmetric matrix M over 0, 1, ∗, defines a partition problem, in which an input graph G is to be partitioned into m parts with adjacencies governed by M, in the sen...
174
click to vote
MONET
2006
15 years 6 months ago
2006
The Open Spectrum approach to spectrum access can achieve near-optimal utilization by allowing devices to sense and utilize available spectrum opportunistically. However, a naive d...
173
click to vote
MP
2006
15 years 6 months ago
2006
Given an undirected graph G = (V;E) and three speci ed terminal nodes t1;t2;t3, a 3-cut is a subset A of E such that no two terminals are in the same component of GnA. If a non-neg...
168
click to vote
IVC
2007
15 years 6 months ago
2007
We introduce a convex relaxation approach for the quadratic assignment problem to the field of computer vision. Due to convexity, a favourable property of this approach is the ab...
187
click to vote
TMC
2008
15 years 6 months ago
2008
In this paper, we consider multihop wireless mesh networks, where each router node is equipped with multiple radio interfaces, and multiple channels are available for communication...