1149 search results - page 94 / 230 » Minimally non-Pfaffian graphs |
151
click to vote
STACS
2010
Springer
16 years 1 months ago
2010
Springer
In the uncapacitated facility location problem, given a graph, a set of demands and opening costs, it is required to find a set of facilities R, so as to minimize the sum of the c...
169
click to vote
ISSAC
2009
Springer
16 years 26 days ago
2009
Springer
We present algorithms and heuristics to compute the characteristic polynomial of a matrix given its minimal polynomial. The matrix is represented as a black-box, i.e., by a functi...
179
click to vote
LION
2007
Springer
16 years 13 days ago
2007
Springer
Abstract. In 1965 Motzkin and Straus established a remarkable connection between the local/global maximizers of the Lagrangian of a graph G over the standard simplex ∆ and the ma...
144
click to vote
FCT
2005
Springer
15 years 11 months ago
2005
Springer
We present an algorithm which calculates a minimum cut and its weight in an undirected graph with nonnegative real edge weights, n vertices and m edges, in time O( ` max (log n, mi...
170
click to vote
IPSN
2005
Springer
15 years 11 months ago
2005
Springer
We consider coverage problems in sensor networks of stationary nodes with minimal geometric data. In particular, there are no coordinates and no localization of nodes. We introduc...