356 search results - page 14 / 72 » A Most General Edge Elimination Polynomial - Thickening of E... |
102
click to vote
DAM
2007
15 years 7 days ago
2007
In 1997 Lampert and Slater introduced parallel knock-out schemes, an iterative process on graphs that goes through several rounds. In each round of this process, every vertex elim...
ICCV
2007
IEEE
16 years 2 months ago
2007
IEEE
We pose robust matching with parametric and non-parametric constraints as the problem of finding a stable independent set (SIS) in an oriented graph whose vertices are all possible...
AAIM
2009
Springer
15 years 6 months ago
2009
Springer
We introduce the s-Plex Editing problem generalizing the well-studied Cluster Editing problem, both being NP-hard and both being motivated by graph-based data clustering. Instead o...
81
Voted
JCT
2008
15 years 7 days ago
2008
A 4-graph is odd if its vertex set can be partitioned into two sets so that every edge intersects both parts in an odd number of points. Let b(n) = max n 3 + (n - ) 3 = 1 2 + o...
106
click to vote
CORR
2008
Springer
14 years 12 months ago
2008
Springer
Abstract--In the past few years, the problem of distributed consensus has received a lot of attention, particularly in the framework of ad hoc sensor networks. Most methods propose...