Sciweavers

271 search results - page 39 / 55
» Quasi-isometries between graphs and trees
Sort
View
FASE
2012
Springer
12 years 3 months ago
Integration Testing of Software Product Lines Using Compositional Symbolic Execution
Software product lines are families of products defined by feature commonality and variability, with a well-managed asset base. Recent work in testing of software product lines ha...
Jiangfan Shi, Myra B. Cohen, Matthew B. Dwyer
STOC
2004
ACM
121views Algorithms» more  STOC 2004»
14 years 8 months ago
Lower bounds for dynamic connectivity
We prove an (lg n) cell-probe lower bound on maintaining connectivity in dynamic graphs, as well as a more general trade-off between updates and queries. Our bound holds even if t...
Mihai Patrascu, Erik D. Demaine
ICDE
2009
IEEE
216views Database» more  ICDE 2009»
13 years 5 months ago
Continuous Subgraph Pattern Search over Graph Streams
Search over graph databases has attracted much attention recently due to its usefulness in many fields, such as the analysis of chemical compounds, intrusion detection in network t...
Changliang Wang, Lei Chen 0002
ORDER
2006
97views more  ORDER 2006»
13 years 7 months ago
Upward Three-Dimensional Grid Drawings of Graphs
A three-dimensional grid drawing of a graph is a placement of the vertices at distinct points with integer coordinates, such that the straight line segments representing the edges ...
Vida Dujmovic, David R. Wood
RSA
2010
94views more  RSA 2010»
13 years 6 months ago
Word maps and spectra of random graph lifts
We study here the spectra of random lifts of graphs. Let G be a finite connected graph, and let the infinite tree T be its universal cover space. If λ1 and ρ are the spectral ...
Nati Linial, Doron Puder