2487 search results - page 207 / 498 » Partitions of Graphs into Trees |
164
click to vote
STOC
2006
ACM
16 years 4 months ago
2006
ACM
Let > 0 be a constant. For any edge-weighted planar graph G and a subset S of nodes of G, there is a subgraph H of G of weight a constant times that of the minimum Steiner tree...
139
click to vote
VLSID
2009
IEEE
15 years 10 months ago
2009
IEEE
Abstract— This paper introduces a fuzzy logic based guidance architecture to a graph grammar framework for automated design of analog circuits. The grammar generates circuit topo...
135
click to vote
ISM
2008
IEEE
15 years 10 months ago
2008
IEEE
We present a set of techniques to simplify tree models for faster rendering while retaining their visual resemblance to the original model. This goal is achieved by setting a budg...
125
click to vote
EDBT
2010
ACM
15 years 7 months ago
2010
ACM
Suffix trees are indexing structures that enhance the performance of numerous string processing algorithms. In this paper, we propose cache-conscious suffix tree construction algo...
140
click to vote
ASPDAC
2007
ACM
15 years 7 months ago
2007
ACM
- In routing, finding a rectilinear Steiner minimal tree (RSMT) is a fundamental problem. Today's design often contains rectilinear obstacles, like macro cells, IP blocks, and...