Sciweavers

977 search results - page 36 / 196
» Permuting Web Graphs
Sort
View
FOCS
2005
IEEE
15 years 5 months ago
A Characterization of the (natural) Graph Properties Testable with One-Sided Error
The problem of characterizing all the testable graph properties is considered by many to be the most important open problem in the area of property-testing. Our main result in thi...
Noga Alon, Asaf Shapira
WSDM
2009
ACM
187views Data Mining» more  WSDM 2009»
15 years 6 months ago
Speeding up algorithms on compressed web graphs
A variety of lossless compression schemes have been proposed to reduce the storage requirements of web graphs. One successful approach is virtual node compression [7], in which of...
Chinmay Karande, Kumar Chellapilla, Reid Andersen
APWEB
2006
Springer
15 years 3 months ago
Named Graphs as a Mechanism for Reasoning About Provenance
Named Graphs is a simple, compatible extension to the RDF syntax that enables statements to be made about RDF graphs. This approach is in contrast to earlier attempts such as RDF r...
E. Rowland Watkins, Denis A. Nicole
SEMWEB
2010
Springer
14 years 9 months ago
Signal/Collect: Graph Algorithms for the (Semantic) Web
The Semantic Web graph is growing at an incredible pace, enabling opportunities to discover new knowledge by interlinking and analyzing previously unconnected data sets. This confr...
Philip Stutz, Abraham Bernstein, William Cohen
IV
2003
IEEE
92views Visualization» more  IV 2003»
15 years 5 months ago
Visualizing Weighted Edges in Graphs
This paper introduces a new edge length heuristic that finds a graph layout where the edge lengths are proportional to the weights on the graph edges. The heuristic can be used in...
Peter Rodgers, Paul Mutton