654 search results - page 42 / 131 » Matrix Graph Grammars |
109
click to vote
MICS
2010
14 years 8 months ago
2010
In this paper we consider the k-fixed-endpoint path cover problem on proper interval graphs, which is a generalization of the path cover problem. Given a graph G and a set T of k v...
152
click to vote
ICDM
2006
IEEE
15 years 7 months ago
2006
IEEE
How closely related are two nodes in a graph? How to compute this score quickly, on huge, disk-resident, real graphs? Random walk with restart (RWR) provides a good relevance scor...
GG
2004
Springer
15 years 6 months ago
2004
Springer
A string generating hypergraph grammar is a hyperedge replacement grammar where the resulting language consists of string graphs i.e. hypergraphs modeling strings. With the help of...
106
click to vote
ICML
2010
IEEE
15 years 2 months ago
2010
IEEE
We introduce a novel graph kernel called the Neighborhood Subgraph Pairwise Distance Kernel. The kernel decomposes a graph into all pairs of neighborhood subgraphs of small radius...
CPC
2006
15 years 1 months ago
2006
We observe returns of a simple random walk on a finite graph to a fixed node, and would like to infer properties of the graph, in particular properties of the spectrum of the trans...