336 search results - page 26 / 68 » Analytic Cut Trees |
STOC
2003
ACM
14 years 8 months ago
2003
ACM
Given an undirected graph or an Eulerian directed graph G and a subset S of its vertices, we show how to determine the edge connectivity C of the vertices in S in time O(C3 n log ...
MKM
2009
Springer
14 years 2 months ago
2009
Springer
The extraction of the relations of nested table headers to content cells is automated with a view to constructing narrow domain ontologies of semistructured web data. A taxonomy of...
ARSCOM
2005
13 years 7 months ago
2005
We investigate the supereulerian graph problems within planar graphs, and we prove that if a 2-edge-connected planar graph G is at most three edges short of having two edge-disjoi...
COMBINATORICA
2004
13 years 7 months ago
2004
We extend the basic theory concerning the cycle space of a finite graph to arbitrary infinite graphs, using as infinite cycles the homeomorphic images of the unit circle in the gr...
VLDB
1992
ACM
13 years 11 months ago
1992
ACM
In this paper, we explore the execution of pipelined hash joins in a multiprocessor-based database system. To improve the query execution, an innovative approach on query executio...