4218 search results - page 517 / 844 » Complete sets of cooperations |
123
click to vote
CORR
2010
Springer
15 years 4 months ago
2010
Springer
Quasi-random graphs can be informally described as graphs whose edge distribution closely resembles that of a truly random graph of the same edge density. Recently, Shapira and Yu...
118
click to vote
EOR
2010
15 years 4 months ago
2010
ic copy available at: http://ssrn.com/abstract=1115410 Inventory Systems with Stochastic Demand and Supply: Properties and Approximations Amanda J. Schmitt Center for Transportatio...
120
click to vote
DM
2008
15 years 4 months ago
2008
For a simple path Pr on r vertices, the square of Pr is the graph P2 r on the same set of vertices of Pr , and where every pair of vertices of distance two or less in Pr is connec...
140
click to vote
ENDM
2008
15 years 4 months ago
2008
A graph G is clique-perfect if the cardinality of a maximum clique-independent set of H equals the cardinality of a minimum clique-transversal of H, for every induced subgraph H o...
155
click to vote
IAJIT
2008
15 years 4 months ago
2008
: The fuzzy c-means clustering algorithm has been widely used to obtain the fuzzy k-partitions. This algorithm requires that the user gives the number of clusters k. To find automa...