5100 search results - page 340 / 1020 » The Linear Complexity of a Graph |
142
click to vote
GD
2004
Springer
15 years 10 months ago
2004
Springer
We use Schnyder woods of 3-connected planar graphs to produce convex straight line drawings on a grid of size (n − 2 − ∆) × (n − 2 − ∆). The parameter ∆ ≥ 0 depen...
145
click to vote
IPPS
2002
IEEE
15 years 10 months ago
2002
IEEE
Tiling has long been used to improve cache performance. Recursion has recently been used as a cache-oblivious method of improving cache performance. Both of these techniques are n...
176
click to vote
APPROX
2008
Springer
15 years 7 months ago
2008
Springer
We consider the variant of the minimum vertex cover problem in which we require that the cover induces a connected subgraph. We give new approximation results for this problem in d...
150
Voted
COLOGNETWENTE
2009
15 years 6 months ago
2009
Given a graph G = (V, E), a proper vertex colouring of V is t-frugal if no colour appears more than t times in any neighbourhood and is acyclic if each of the bipartite graphs con...
183
Voted
TIT
2011
14 years 12 months ago
2011
Loopy belief propagation has been employed in a wide variety of applications with great empirical success, but it comes with few theoretical guarantees. In this paper we analyze t...