9842 search results - page 243 / 1969 » The Complexity of the Matching-Cut Problem |
117
Voted
LPAR
2007
Springer
15 years 6 months ago
2007
Springer
Abstract. We consider the temporal logic with since and until modalities. This temporal logic is expressively equivalent over the class of ordinals to first-order logic thanks to ...
95
Voted
VLDB
1997
ACM
15 years 4 months ago
1997
ACM
Scheduling query execution plans is a particularly complex problem in hierarchical parallel systems, where each site consists of a collection of local time-shared (e.g., CPU(s) or...
196
click to vote
COMPGEOM
2011
ACM
14 years 4 months ago
2011
ACM
We present a new algorithm for computing zigzag persistent homology, an algebraic structure which encodes changes to homology groups of a simplicial complex over a sequence of sim...
109
Voted
COCOON
2003
Springer
15 years 5 months ago
2003
Springer
In this paper, we approach the quality of a greedy algorithm for the maximum weighted clique problem from the viewpoint of matroid theory. More precisely, we consider the clique c...
102
Voted
STACS
2010
Springer
15 years 7 months ago
2010
Springer
The degree of a CSP instance is the maximum number of times that a variable may appear in the scope of constraints. We consider the approximate counting problem for Boolean CSPs wi...