44 search results - page 4 / 9 » On the maximum number of edges in topological graphs with no... |
DAM
2008
13 years 8 months ago
2008
Let G = (V + s, E) be a 2-edge-connected graph with a designated vertex s. A pair of edges rs, st is called admissible if splitting off these edges (replacing rs and st by rt) pre...
ISAAC
2005
Springer
14 years 1 months ago
2005
Springer
In an orthogonal drawing of a planar graph G, each vertex is drawn as a point, each edge is drawn as a sequence of alternate horizontal and vertical line segments, and any two edge...
CVPR
2010
IEEE
13 years 9 months ago
2010
IEEE
Multiple surface searching with only image intensity information is a difficult job in the presence of high noise and weak edges. We present in this paper a novel method for global...
INFOCOM
2005
IEEE
14 years 1 months ago
2005
IEEE
— We consider the problem of link scheduling in a sensor network employing a TDMA MAC protocol. Our link scheduling algorithm involves two phases. In the first phase, we assign ...
BMCBI
2010
13 years 8 months ago
2010
Background: While the pairwise alignments produced by sequence similarity searches are a powerful tool for identifying homologous proteins - proteins that share a common ancestor ...