1149 search results - page 72 / 230 » Minimally non-Pfaffian graphs |
154
click to vote
ICTCS
2005
Springer
15 years 11 months ago
2005
Springer
Given a vertex-weighted graph G = (V, E; w), w(v) ≥ 0 for any v ∈ V , we consider a weighted version of the coloring problem which consists in finding a partition S = (S1, . ...
197
click to vote
ACPC
1999
Springer
15 years 10 months ago
1999
Springer
Abstract. A number of techniques are described for solving sparse linear systems on parallel platforms. The general approach used is a domaindecomposition type method in which a pr...
162
click to vote
ICRA
2010
IEEE
15 years 4 months ago
2010
IEEE
— The problem of coverage of known space by a mobile robot has many applications. Of particular interest is providing a solution that guarantees the complete coverage of the free...
192
click to vote
MICS
2008
15 years 4 months ago
2008
We present an approach to studying the community structures of networks by using linear programming (LP). Starting with a network in terms of (a) a collection of nodes and (b) a co...
165
click to vote
ICPR
2010
IEEE
15 years 3 months ago
2010
IEEE
We present a method for object tracking over time sequence imagery. The image plane is represented with a 4-connected planar graph where vertices are associated with pixels. On ea...