4865 search results - page 181 / 973 » The Complexity of Graph Connectivity |
168
Voted
PODC
2012
ACM
13 years 6 months ago
2012
ACM
This work presents a classification of weak models of distributed computing. We focus on deterministic distributed algorithms, and we study models of computing that are weaker ve...
145
Voted
STOC
1996
ACM
15 years 7 months ago
1996
ACM
We significantly improve known time bounds for solving the minimum cut problem on undirected graphs. We use a "semiduality" between minimum cuts and maximum spanning tree...
115
Voted
ICIP
1997
IEEE
16 years 5 months ago
1997
IEEE
We develop a new approach to image denoising based on complexity regularization. This technique presents a flexible alternative to the more conventional l2 , l1 , and Besov regula...
150
Voted
IWPC
2002
IEEE
15 years 8 months ago
2002
IEEE
Program slicing has many applications in software engineering activities including program comprehension, debugging, testing, maintenance, and model checking. In this paper, we pr...
122
Voted
DM
2006
15 years 3 months ago
2006
Assuming that every proper minor closed class of graphs contains a maximum with respect to the homomorphism order, we prove that such a maximum must be homomorphically equivalent ...