1201 search results - page 10 / 241 » Linear Probing and Graphs |
KES
2008
Springer
13 years 9 months ago
2008
Springer
We present a method for designing efficient multigenic predictors with few probes and its application to the prediction of the response to preoperative chemotherapy in breast cance...
CORR
2004
Springer
13 years 9 months ago
2004
Springer
A Meyniel graph is a graph in which every odd cycle of length at least five has two chords. We present a linear-time algorithm that colors optimally the vertices of a Meyniel grap...
WG
1999
Springer
14 years 2 months ago
1999
Springer
Abstract. In random geometric graphs, vertices are randomly distributed on [0, 1]2 and pairs of vertices are connected by edges whenever they are sufficiently close together. Layou...
WADS
2009
Springer
14 years 4 months ago
2009
Springer
Abstract. We introduce the simultaneous representation problem, defined for any graph class C characterized in terms of representations, e.g. any class of intersection graphs. Two...
PAMI
2006
13 years 9 months ago
2006
A binary linear programming formulation of the graph edit distance for unweighted, undirected graphs with vertex attributes is derived and applied to a graph recognition problem. ...