Sciweavers

271 search results - page 33 / 55
» Quasi-isometries between graphs and trees
Sort
View
WEA
2009
Springer
139views Algorithms» more  WEA 2009»
14 years 2 months ago
Fast Algorithm for Graph Isomorphism Testing
Abstract. In this paper we present a novel approach to the graph isomorphism problem. We combine a direct approach, that tries to find a mapping between the two input graphs using...
José Luis López-Presa, Antonio Fern&...
BMCBI
2010
83views more  BMCBI 2010»
13 years 7 months ago
Trees on networks: resolving statistical patterns of phylogenetic similarities among interacting proteins
Background: Phylogenies capture the evolutionary ancestry linking extant species. Correlations and similarities among a set of species are mediated by and need to be understood in...
William P. Kelly, Michael P. H. Stumpf
IPPS
2002
IEEE
14 years 17 days ago
Optimizing Graph Algorithms for Improved Cache Performance
Tiling has long been used to improve cache performance. Recursion has recently been used as a cache-oblivious method of improving cache performance. Both of these techniques are n...
Joon-Sang Park, Michael Penner, Viktor K. Prasanna
SODA
1990
ACM
114views Algorithms» more  SODA 1990»
13 years 8 months ago
Finding Steiner Forests in Planar Graphs
Given an unweighted planar graph G together with nets of terminals, our problem is to find a Steiner forest, i.e., vertex-disjoint trees, each of which interconnects all the termin...
Hitoshi Suzuki, Takehiro Akama, Takao Nishizeki
TPDS
2008
96views more  TPDS 2008»
13 years 7 months ago
Stochastic Graph Processes for Performance Evaluation of Content Delivery Applications in Overlay Networks
This paper proposes a new methodology to model the distribution of finite size content to a group of users connected through an overlay network. Our methodology describes the distr...
Damiano Carra, Renato Lo Cigno, Ernst W. Biersack