653 search results - page 54 / 131 » The size of minimum 3-trees |
166
click to vote
DAM
2008
15 years 6 months ago
2008
In this paper, we address the following problem: given a synchronous digital circuit, is it possible to construct a new circuit computing the same function as the original one but...
135
click to vote
DM
2008
15 years 6 months ago
2008
A set S of vertices of a graph G is a geodetic set if every vertex of G lies in at least one interval between the vertices of S. The size of a minimum geodetic set in G is the geo...
140
click to vote
IPL
2007
15 years 6 months ago
2007
We study the approximability and inapproximability of finding identifying codes and locating-dominating codes of the minimum size. In general graphs, we show that it is possible ...
191
click to vote
VLSID
2005
IEEE
16 years 6 months ago
2005
IEEE
High level synthesis tools transform an algorithmic description to a register transfer language (RTL) description of the hardware. The algorithm behavior is typically described in...
186
click to vote
FOCS
2008
IEEE
16 years 23 days ago
2008
IEEE
We present a technique for transforming classical approximation algorithms into constant-time algorithms that approximate the size of the optimal solution. Our technique is applic...