3757 search results - page 524 / 752 » The overlap number of a graph |
199
click to vote
FOCS
2008
IEEE
16 years 1 months ago
2008
IEEE
Dynamic connectivity is a well-studied problem, but so far the most compelling progress has been confined to the edge-update model: maintain an understanding of connectivity in a...
164
click to vote
COLT
2007
Springer
16 years 22 days ago
2007
Springer
We present a new class of problems, called resource-bounded information gathering for correlation clustering. Our goal is to perform correlation clustering under circumstances in w...
150
click to vote
SWAT
2004
Springer
15 years 12 months ago
2004
Springer
In this paper, we consider the problems of generating all maximal (bipartite) cliques in a given (bipartite) graph G = (V, E) with n vertices and m edges. We propose two algorithms...
178
click to vote
ICDE
2010
IEEE
15 years 12 months ago
2010
IEEE
— In recent years, the research community introduced various methods for processing skyline queries in multidimensional databases. The skyline operator retrieves all objects bein...
153
click to vote
RECOMB
2010
Springer
15 years 11 months ago
2010
Springer
Abstract. We consider the problem of aligning two metabolic pathways. Unlike traditional approaches, we do not restrict the alignment to one-to-one mappings between the molecules o...