1149 search results - page 7 / 230 » Minimally non-Pfaffian graphs |
167
click to vote
CIMCA
2005
IEEE
16 years 6 days ago
2005
IEEE
Minimal Switching Graph (MSG) is a graphical model for the constrained via minimization problem — a combinatorial optimization problem in integrated circuit design automation. F...
194
click to vote
CASES
2010
ACM
15 years 3 months ago
2010
ACM
Approximate arithmetic is a promising, new approach to lowenergy designs while tackling reliability issues. We present a method to optimally distribute a given energy budget among...
138
click to vote
ARSCOM
1999
15 years 6 months ago
1999
For a given graph G, we fix s, and partition the vertex set into s classes, so that any given class contains few edges. The result gives a partition (U1,
215
click to vote
AAIM
2007
Springer
16 years 24 days ago
2007
Springer
Given an undirected graph G = (V, E) and a weight function w : E → Z+ , we consider the problem of orienting all edges in E so that the maximum weighted outdegree among all verti...
165
click to vote
IPPS
1999
IEEE
15 years 11 months ago
1999
IEEE
This paper proposes a method for reducing the maximum degree of vertices in graphs that maintain optimal broadcast time when a vertex can call a vertex at distance at most k durin...