10997 search results - page 87 / 2200 » On the Structure of Complete Sets |
231
click to vote
SDM
2011
SIAM
14 years 8 months ago
2011
SIAM
While the social and information networks have become ubiquitous, the challenge of collecting complete network data still persists. Many times the collected network data is incomp...
138
click to vote
COCOON
2007
Springer
16 years 3 days ago
2007
Springer
An r-component connected coloring of a graph is a coloring of the vertices so that each color class induces a subgraph having at most r connected components. The concept has been w...
167
click to vote
BMCBI
2002
15 years 5 months ago
2002
Background: Functional genomics involves the parallel experimentation with large sets of proteins. This requires management of large sets of open reading frames as a prerequisite ...
136
click to vote
APPML
2002
15 years 5 months ago
2002
A method for structural clustering is proposed involving data on subset-to-entity linkages that can be calculated with structural data such as graphs or sequences or images. The m...
190
click to vote
ATAL
2010
Springer
15 years 7 months ago
2010
Springer
We consider the computational complexity of pure Nash equilibria in graphical games. It is known that the problem is NP-complete in general, but tractable (i.e., in P) for special...