Results 11  20
of
3,697
Keyword searching and browsing in databases using BANKS
 In ICDE
, 2002
"... With the growth of the Web, there has been a rapid increase in the number of users who need to access online databases without having a detailed knowledge of the schema or of query languages; even relatively simple query languages designed for nonexperts are too complicated for them. We describe BA ..."
Abstract

Cited by 321 (14 self)
 Add to MetaCart
keywords, following hyperlinks, and interacting with controls on the displayed results. BANKS models tuples as nodes in a graph, connected by links induced by foreign key and other relationships. Answers to a query are modeled as rooted trees connecting tuples that match individual keywords in the query
On Distinguishing between Internet Power Law Topology Generators
, 2002
"... Recent work has shown that the node degree in the WWW induced graph and the ASlevel Internet topology exhibit power laws. Since then several algorithms have been proposed to generate such power law graphs. In this paper we evaluate the effectiveness of these generators to generate representative AS ..."
Abstract

Cited by 256 (4 self)
 Add to MetaCart
Recent work has shown that the node degree in the WWW induced graph and the ASlevel Internet topology exhibit power laws. Since then several algorithms have been proposed to generate such power law graphs. In this paper we evaluate the effectiveness of these generators to generate representative
Efficient Identification of Web Communities
 IN SIXTH ACM SIGKDD INTERNATIONAL CONFERENCE ON KNOWLEDGE DISCOVERY AND DATA MINING
, 2000
"... We define a community on the web as a set of sites that have more links (in either direction) to members of the community than to nonmembers. Members of such a community can be eciently identified in a maximum flow / minimum cut framework, where the source is composed of known members, and the sink ..."
Abstract

Cited by 293 (13 self)
 Add to MetaCart
, and the sink consists of wellknown nonmembers. A focused crawler that crawls to a fixed depth can approximate community membership by augmenting the graph induced by the crawl with links to a virtual sink node. The effectiveness of the approximation algorithm is demonstrated with several crawl results
Efficient Testing of Large Graphs
 Combinatorica
"... Let P be a property of graphs. An test for P is a randomized algorithm which, given the ability to make queries whether a desired pair of vertices of an input graph G with n vertices are adjacent or not, distinguishes, with high probability, between the case of G satisfying P and the case that it h ..."
Abstract

Cited by 176 (47 self)
 Add to MetaCart
if all graphs that differ from G in no more than jGj 2 places contain an induced copy of H . A graph H is called abundant in G if G contains at least jGj jHj induced copies of H. If H is unavoidable in G then it is also ( ; jHj)abundant.
Geometric Shortest Paths and Network Optimization
 Handbook of Computational Geometry
, 1998
"... Introduction A natural and wellstudied problem in algorithmic graph theory and network optimization is that of computing a "shortest path" between two nodes, s and t, in a graph whose edges have "weights" associated with them, and we consider the "length" of a path to ..."
Abstract

Cited by 187 (15 self)
 Add to MetaCart
instance of a shortest path problem is usually specified by giving geometric objects that implicitly encode the graph and its edge weights. Our goal in devising efficient geometric algorithms is generally to avoid explicit construction of the entire underlying graph, since the full induced graph may
Linear time solvable optimization problems on graphs of bounded cliquewidth
, 2000
"... Hierarchical decompositions of graphs are interesting for algorithmic purposes. There are several types of hierarchical decompositions. Tree decompositions are the best known ones. On graphs of treewidth at most k, i.e., that have tree decompositions of width at most k, where k is fixed, every dec ..."
Abstract

Cited by 170 (24 self)
 Add to MetaCart
allowed to use edge set quantifications. We develop applications to several classes of graphs that include cographs and are, like cographs, defined by forbidding subgraphs with “too many” induced paths with four vertices.
Subgraph Isomorphism in Planar Graphs and Related Problems
, 1999
"... We solve the subgraph isomorphism problem in planar graphs in linear time, for any pattern of constant size. Our results are based on a technique of partitioning the planar graph into pieces of small treewidth, and applying dynamic programming within each piece. The same methods can be used to ..."
Abstract

Cited by 150 (2 self)
 Add to MetaCart
to solve other planar graph problems including connectivity, diameter, girth, induced subgraph isomorphism, and shortest paths.
Results 11  20
of
3,697