2137 search results - page 253 / 428 » Approximation Algorithms for Some Graph Partitioning Problem... |
184
click to vote
SSDBM
2010
IEEE
15 years 4 months ago
2010
IEEE
Skyline queries have attracted considerable attention over the last few years, mainly due to their ability to return interesting objects without the need for user-defined scoring f...
167
click to vote
TIP
2008
15 years 6 months ago
2008
This paper presents recursive cavity modeling--a principled, tractable approach to approximate, near-optimal inference for large Gauss-Markov random fields. The main idea is to su...
171
click to vote
CAV
2003
Springer
15 years 11 months ago
2003
Springer
We show that the model checking problem for µ-calculus on graphs of bounded tree-width can be solved in time linear in the size of the system. The result is presented by first sh...
171
click to vote
JACM
2000
15 years 6 months ago
2000
A simple variant of a priority queue, called a soft heap, is introduced. The data structure supports the usual operations: insert, delete, meld, and findmin. Its novelty is to beat...
159
Voted
DAM
2002
15 years 6 months ago
2002
In the strong edge coloring problem, the objective is to color the edges of the given graph with the minimum number of colors so that every color class is an induced matching. In ...