1545 search results - page 113 / 309 » On tree congestion of graphs |
100
click to vote
STOC
2006
ACM
15 years 10 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...
VLSID
2009
IEEE
15 years 4 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...
102
click to vote
ICASSP
2011
IEEE
14 years 1 months ago
2011
IEEE
We present a polytope-kernel density estimation (PKDE) methodology that allows us to perform exact mean-shift updates along the edges of the Delaunay graph of the data. We discuss...
AAAI
1996
14 years 11 months ago
1996
GSAT is a randomized greedy local repair procedure that was introduced for solving propositional satis ability and constraint satisfaction problems. We present an improvement to G...
INFOCOM
1999
IEEE
15 years 2 months ago
1999
IEEE
We propose a flow-control scheme for multicast ABR services in ATM networks. At the heart of the proposed scheme is an optimal secondorder rate control algorithm, called the -contr...