1493 search results - page 164 / 299 » Local resilience of graphs |
104
Voted
KDD
2006
ACM
16 years 1 months ago
2006
ACM
Various data mining applications involve data objects of multiple types that are related to each other, which can be naturally formulated as a k-partite graph. However, the resear...
118
click to vote
PODC
2006
ACM
15 years 6 months ago
2006
ACM
Coloring the nodes of a graph with a small number of colors is one of the most fundamental problems in theoretical computer science. In this paper, we study graph coloring in a di...
122
click to vote
WINE
2005
Springer
15 years 6 months ago
2005
Springer
Consider a network vulnerable to viral infection. The system security software can guarantee safety only to a limited part of the network. Such limitations result from economy cos...
140
click to vote
PPDP
2010
Springer
14 years 11 months ago
2010
Springer
This paperdescribes the use of a powerful graph query language for querying programs, and a novel combination of transformations for generating efficient implementations of the q...
108
Voted
IJON
2010
14 years 10 months ago
2010
Graph construction plays a key role on learning algorithms based on graph Laplacian. However, the traditional graph construction approaches of -neighborhood and k-nearest-neighbor...