280 search results - page 4 / 56 » Using Determining Sets to Distinguish Kneser Graphs |
139
click to vote
SWAT
2004
Springer
15 years 9 months ago
2004
Springer
In this paper, we investigate the test set problem and its variations that appear in a variety of applications. In general, we are given a universe of objects to be “distinguish...
122
click to vote
CORR
2007
Springer
15 years 4 months ago
2007
Springer
We consider complete graphs with edge weights and/or node weights taking values in some set. In the first part of this paper, we show that a large number of graphs are completely...
138
click to vote
TCS
2008
15 years 3 months ago
2008
We consider the problem of periodic graph exploration by a finite automaton in which an automaton with a constant number of states has to explore all unknown anonymous graphs of a...
125
click to vote
ESANN
2008
15 years 5 months ago
2008
In this work, we developed classifiers to distinguish between four ovarian tumor types using Bayesian least squares support vector machines (LS-SVMs) and kernel logistic regression...
181
click to vote
PKDD
2004
Springer
15 years 9 months ago
2004
Springer
The problem of discovering frequent subgraphs of graph data can be solved by constructing a candidate set of subgraphs first, and then, identifying within this candidate set those...