Sciweavers

2125 search results - page 102 / 425
» On Graph Complexity
Sort
View
ICDE
2002
IEEE
206views Database» more  ICDE 2002»
14 years 11 months ago
Exploiting Local Similarity for Indexing Paths in Graph-Structured Data
XML and other semi-structured data may have partially specified or missing schema information, motivating the use of a structural summary which can be automatically computed from ...
Raghav Kaushik, Pradeep Shenoy, Philip Bohannon, E...
ESA
2009
Springer
127views Algorithms» more  ESA 2009»
14 years 4 months ago
Maximum Flow in Directed Planar Graphs with Vertex Capacities
In this paper we present an O(n log n) algorithm for finding a maximum flow in a directed planar graph, where the vertices are subject to capacity constraints, in addition to the...
Haim Kaplan, Yahav Nussbaum
ICDE
2010
IEEE
266views Database» more  ICDE 2010»
14 years 9 months ago
Provenance Browser: Displaying and Querying Scientific Workflow Provenance Graphs
Abstract-- This demonstration presents an interactive provenance browser for visualizing and querying data dependency (lineage) graphs produced by scientific workflow runs. The bro...
Bertram Ludäscher, Manish Kumar Anand, Shawn ...
CMSB
2006
Springer
14 years 1 months ago
Randomization and Feedback Properties of Directed Graphs Inspired by Gene Networks
Having in mind the large-scale analysis of gene regulatory networks, we review a graph decimation algorithm, called "leaf-removal", which can be used to evaluate the feed...
M. Cosentino Lagomarsino, P. Jona, B. Bassetti
KDD
2003
ACM
217views Data Mining» more  KDD 2003»
14 years 10 months ago
Algorithms for estimating relative importance in networks
Large and complex graphs representing relationships among sets of entities are an increasingly common focus of interest in data analysis--examples include social networks, Web gra...
Scott White, Padhraic Smyth