Sciweavers

678 search results - page 3 / 136
» Structural Properties of Sparse Graphs
Sort
View
ENTCS
2007
112views more  ENTCS 2007»
13 years 5 months ago
Structure and Properties of Traces for Functional Programs
The tracer Hat records in a detailed trace the computation of a program written in the lazy functional language Haskell. The trace can then be viewed in various ways to support pr...
Olaf Chitil, Yong Luo
WADS
2007
Springer
180views Algorithms» more  WADS 2007»
13 years 11 months ago
Spanners for Geometric Intersection Graphs
A ball graph is an intersection graph of a set of balls with arbitrary radii. Given a real number t > 1, we say that a subgraph G′ of a graph G is a t-spanner of G, if for eve...
Martin Fürer, Shiva Prasad Kasiviswanathan
INFOCOM
2011
IEEE
12 years 8 months ago
Approximate distance queries and compact routing in sparse graphs
—An approximate distance query data structure is a compact representation of a graph, and can be queried to approximate shortest paths between any pair of vertices. Any such data...
Rachit Agarwal, Philip Brighten Godfrey, Sariel Ha...
CIKM
2006
Springer
13 years 9 months ago
On the structural properties of massive telecom call graphs: findings and implications
With ever growing competition in telecommunications markets, operators have to increasingly rely on business intelligence to offer the right incentives to their customers. Toward ...
Amit Anil Nanavati, Siva Gurumurthy, Gautam Das, D...
COMPUTING
1999
99views more  COMPUTING 1999»
13 years 5 months ago
A Minimal Line Property Preserving Representation of Line Images
In line image understandingaminimal lineproperty preserving(MLPP)graphoftheimagecompliments the structural information in geometric graph representations like the run graph. With ...
Mark Burge, Walter G. Kropatsch