2531 search results - page 124 / 507 » Group testing in graphs |
83
Voted
FCT
2005
Springer
15 years 6 months ago
2005
Springer
A partitioning of a set of n items is a grouping of these items into k disjoint, equally sized classes. Any partition can be modeled as a graph. The items become the vertices of th...
103
Voted
KDD
2010
ACM
15 years 2 months ago
2010
ACM
Advances in data collection and storage capacity have made it increasingly possible to collect highly volatile graph data for analysis. Existing graph analysis techniques are not ...
120
Voted
DAM
2008
15 years 27 days ago
2008
Polar graphs are a common generalization of bipartite, cobipartite, and split graphs. They are defined by the existence of a certain partition of vertices, which is NPcomplete to ...
119
click to vote
ICANNGA
2007
Springer
15 years 4 months ago
2007
Springer
Abstract. The use of support vector machines for multi-category problems is still an open field to research. Most of the published works use the one-against-rest strategy, but with...
WG
2004
Springer
15 years 6 months ago
2004
Springer
In this paper, we consider the recognition problem on two classes of perfectly orderable graphs, namely, the HHD-free and the Welsh-Powell opposition graphs (or WPO-graphs). In par...