540 search results - page 38 / 108 » New bounds on the edge number of a k-map graph |
157
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
We obtain improved upper bounds and new lower bounds on the chromatic number as a linear function of the clique number, for the intersection graphs (and their complements) of fini...
132
click to vote
TMI
2010
15 years 4 months ago
2010
Abstract—The pinhole camera in single photon emission computed tomography (SPECT) has an inherent trade-off between resolution and sensitivity. Recent systems overcome this to so...
170
click to vote
SIAMCOMP
2010
15 years 27 days ago
2010
In the first part of the paper, we reexamine the all-pairs shortest paths (APSP) problem and present a new algorithm with running time O(n3 log3 log n/ log2 n), which improves all...
182
click to vote
ESA
2008
Springer
15 years 8 months ago
2008
Springer
Abstract. We consider the problem of encoding a graph with n vertices and m edges compactly supporting adjacency, neighborhood and degree queries in constant time in the log n-bit ...
186
click to vote
ISMVL
2007
IEEE
16 years 12 days ago
2007
IEEE
This paper proposes a method to represent elementary functions such as trigonometric, logarithmic, square root, and reciprocal functions using edge-valued multi-valued decision di...