Sciweavers

1274 search results - page 129 / 255
» Graph lambda theories
Sort
View
WDAG
2009
Springer
147views Algorithms» more  WDAG 2009»
14 years 3 months ago
Compact Routing in Power-Law Graphs
Abstract. We adapt the compact routing scheme by Thorup and Zwick to optimize it for power-law graphs. We analyze our adapted routing scheme based on the theory of unweighted rando...
Wei Chen, Christian Sommer 0002, Shang-Hua Teng, Y...
AGTIVE
2003
Springer
14 years 2 months ago
Specifying Pointer Structures by Graph Reduction
Graph-reduction specifications (GRSs) are a powerful new method for specifying classes of pointer data structures (shapes). They cover important shapes, like various forms of bal...
Adam Bakewell, Detlef Plump, Colin Runciman
BMCBI
2005
120views more  BMCBI 2005»
13 years 9 months ago
SpectralNET - an application for spectral graph analysis and visualization
Background: Graph theory provides a computational framework for modeling a variety of datasets including those emerging from genomics, proteomics, and chemical genetics. Networks ...
Joshua J. Forman, Paul A. Clemons, Stuart L. Schre...
CN
2010
121views more  CN 2010»
13 years 5 months ago
Probabilistic flooding for efficient information dissemination in random graph topologies
Probabilistic flooding has been frequently considered as a suitable dissemination information approach for limiting the large message overhead associated with traditional (full) f...
Konstantinos Oikonomou, Dimitrios Kogias, Ioannis ...
ICFP
2007
ACM
14 years 9 months ago
Termination analysis and call graph construction for higher-order functional programs
The analysis and verification of higher-order programs raises the issue of control-flow analysis for higher-order languages. The problem of constructing an accurate call graph for...
Damien Sereni