137 search results - page 16 / 28 » Critical Subgraphs of a Random Graph |
ICDM
2008
IEEE
14 years 4 months ago
2008
IEEE
This paper studies how to incorporate side information (such as users’ feedback) in measuring node proximity on large graphs. Our method (ProSIN) is motivated by the well-studie...
SODA
2012
ACM
12 years 7 days ago
2012
ACM
Given a class of graphs F, we say that a graph G is universal for F, or F-universal, if every H ∈ F is contained in G as a subgraph. The construction of sparse universal graphs ...
MICRO
2003
IEEE
14 years 3 months ago
2003
IEEE
Application-specific extensions to the computational capabilities of a processor provide an efficient mechanism to meet the growing performance and power demands of embedded appl...
ESA
2007
Springer
14 years 4 months ago
2007
Springer
We present an experimental evaluation of an approximate distance oracle recently suggested by Thorup [1] for undirected planar graphs. The oracle uses the existence of graph separa...
CL
2012
Springer
12 years 8 days ago
2012
Springer
In object-oriented systems, runtime memory is composed of an object graph in which objects refer to other objects. This graph of objects evolves while the system is running. Graph...