1199 search results - page 94 / 240 » Graph Theory |
135
click to vote
STACS
2009
Springer
15 years 10 months ago
2009
Springer
The notions of hypertree width and generalized hypertree width were introduced by Gottlob, Leone, and Scarcello in order to extend the concept of hypergraph acyclicity. These noti...
145
click to vote
AMAI
2004
Springer
15 years 9 months ago
2004
Springer
We study three new techniques which will speed up the branch-and-bound algorithm for the MAX-2-SAT problem: The first technique is a new lower bound function for the algorithm an...
125
Voted
SEMWEB
2007
Springer
15 years 10 months ago
2007
Springer
Abstract The most common matching applications, e.g., ontology matching, focus on the computation of the correspondences holding between the nodes of graph structures (e.g., concep...
133
click to vote
STACS
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. The perfect matching problem is known to be in ¶, in randomized NC, and it is hard for NL. Whether the perfect matching problem is in NC is one of the most prominent ope...
129
click to vote
SIGMOD
1999
ACM
15 years 8 months ago
1999
ACM
Recovery can be extended to new domains at reduced logging cost by exploiting "logical" log operations. During recovery, a logical log operation may read data values fro...