26 search results - page 5 / 6 » Edge Growth in Graph Cubes |
JGT
2008
13 years 7 months ago
2008
A spanning subgraph G of a graph H is a k-detour subgraph of H if for each pair of vertices x, y V (H), the distance, distG(x, y), between x and y in G exceeds that in H by at mo...
BMCBI
2007
13 years 7 months ago
2007
Background: In recent years, an extensive characterization of network structures has been made in an effort to elucidate design principles of metabolic networks, providing valuabl...
KDD
2005
ACM
14 years 7 months ago
2005
ACM
How do real graphs evolve over time? What are "normal" growth patterns in social, technological, and information networks? Many studies have discovered patterns in stati...
CVPR
2003
IEEE
14 years 9 months ago
2003
IEEE
Probabilistic models have been adopted for many computer vision applications, however inference in highdimensional spaces remains problematic. As the statespace of a model grows, ...
POPL
2007
ACM
14 years 7 months ago
2007
ACM
A memory leak in a garbage-collected program occurs when the program inadvertently maintains references to objects that it no longer needs. Memory leaks cause systematic heap grow...