1105 search results - page 65 / 221 » Linear choosability of graphs |
146
click to vote
STOC
1990
ACM
15 years 8 months ago
1990
ACM
ions (Extended Abstract) Noga Alon Paul Seymour Robin Thomas Let G be an n-vertex graph with nonnegative weights whose sum is 1 assigned to its vertices, and with no minor isomorp...
110
click to vote
CDC
2009
IEEE
15 years 8 months ago
2009
IEEE
Abstract—This work considers the problem of reaching consensus in an unreliable linear consensus network. A solution to this problem is relevant for several tasks in multi-agent ...
115
click to vote
IJCNN
2000
IEEE
15 years 8 months ago
2000
IEEE
The class of piecewise linear homeomorphisms (PLH) provides a convenient functional representation for many applications wherein an approximation to data is required that is inver...
112
click to vote
ICCV
2007
IEEE
16 years 6 months ago
2007
IEEE
Markov Random Fields (MRFs) are ubiquitous in lowlevel computer vision. In this paper, we propose a new approach to the optimization of multi-labeled MRFs. Similarly to -expansion...
135
click to vote
ESA
2009
Springer
15 years 10 months ago
2009
Springer
In this paper we present an O(n log n) algorithm for finding a maximum flow in a directed planar graph, where the vertices are subject to capacity constraints, in addition to the...