6598 search results - page 311 / 1320 » Graph Theory with Applications |
202
click to vote
CACM
1998
15 years 6 months ago
1998
abstraction for modeling these problems is to view the Web as a collection of (usually small and heterogeneous) databases, and to view programs that extract and process Web data au...
177
click to vote
AMAI
2004
Springer
16 years 1 days 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...
175
click to vote
KDD
2004
ACM
16 years 6 hour ago
2004
ACM
We present a graph-theoretic approach to discover storylines from search results. Storylines are windows that offer glimpses into interesting themes latent among the top search re...
197
click to vote
COCOON
2003
Springer
15 years 12 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...
155
click to vote
COCO
2010
Springer
15 years 10 months ago
2010
Springer
Designing algorithms that use logarithmic space for graph reachability problems is fundamental to complexity theory. It is well known that for general directed graphs this problem...