3192 search results - page 370 / 639 » The minimum latency problem |
145
click to vote
MP
2006
15 years 4 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...
126
click to vote
PAMI
2006
15 years 4 months ago
2006
A binary linear programming formulation of the graph edit distance for unweighted, undirected graphs with vertex attributes is derived and applied to a graph recognition problem. ...
137
click to vote
IJRR
2007
15 years 4 months ago
2007
This paper addresses the pursuit-evasion problem of maintaining surveillance by a pursuer of an evader in a world populated by polygonal obstacles. This requires the pursuer to pl...
128
click to vote
IJFCS
1998
15 years 4 months ago
1998
Directed acyclic graphs (dags) are often used to model circuits. Path lengths in such dags represent circuit delays. In the vertex splitting problem, the objective is to determine...
124
click to vote
CORR
2010
Springer
15 years 3 months ago
2010
Springer
—Considering the interaction through mutual interference of the different radio devices, the channel selection (CS) problem in decentralized parallel multiple access channels can...