554 search results - page 54 / 111 » Optimizing in Graphs with Expensive Computation of Edge Weig... |
ACSC
2005
IEEE
14 years 2 months ago
2005
IEEE
A k-separated matching in a graph is a set of edges at distance at least k from one another (hence, for instance, a 1-separated matching is just a matching in the classical sense)...
TON
2010
13 years 7 months ago
2010
Abstract—Comparing graphs to determine the level of underlying structural similarity between them is a widely encountered problem in computer science. It is particularly relevant...
GD
2006
Springer
14 years 11 days ago
2006
Springer
Circular graph layout is a drawing scheme where all nodes are placed on the perimeter of a circle. An inherent issue with circular layouts is that the rigid restriction on node pla...
DATE
2007
IEEE
14 years 3 months ago
2007
IEEE
Abstract— The impact of process variations increases as technology scales to nanometer region. Under large process variations, the path and arc/node criticality [18] provide effe...
BIRD
2008
Springer
13 years 10 months ago
2008
Springer
Abstract. Gaussian graphical models are widely used to tackle the important and challenging problem of inferring genetic regulatory networks from expression data. These models have...