241 search results - page 29 / 49 » Graphs, Hypergraphs and Hashing |
120
click to vote
DM
2006
15 years 1 months ago
2006
Let F1, F2, . . . , Fk be graphs with the same vertex set V . A subset S V is a factor dominating set if in every Fi every vertex not in S is adjacent to a vertex in S, and a fac...
122
click to vote
AIRWEB
2009
Springer
15 years 8 months ago
2009
Springer
Spammers in social bookmarking systems try to mimick bookmarking behaviour of real users to gain the attention of other users or search engines. Several methods have been proposed...
103
click to vote
ICDM
2009
IEEE
14 years 11 months ago
2009
IEEE
The design of a good kernel is fundamental for knowledge discovery from graph-structured data. Existing graph kernels exploit only limited information about the graph structures bu...
ENTCS
2007
15 years 1 months ago
2007
In the theory of graph rewriting, the use of coalescing rules, i.e., of rules which besides deleting and generating graph items, can coalesce some parts of the graph, turns out to...
GG
2008
Springer
15 years 3 months ago
2008
Springer
The tautology problem is the problem to prove the validity of statements. In this paper, we present a calculus for this undecidable problem on graphical conditions, prove its sound...