Pages that link to "Item:Q158221"
From MaRDI portal
The following pages link to On the distribution of the domination number for random class cover catch digraphs (Q158221):
Displaying 20 items.
- Spatial Clustering Tests Based on the Domination Number of a New Random Digraph Family (Q82973) (← links)
- rcccd (Q158227) (← links)
- Comparison of relative density of two random geometric digraph families in testing spatial clustering (Q464444) (← links)
- Edge density of new graph types based on a random digraph family (Q670163) (← links)
- The distribution of the relative arc density of a family of interval catch digraph based on uniform data (Q715495) (← links)
- Classification using proximity catch digraphs (Q782440) (← links)
- A general SLLN for the one-dimensional class cover problem (Q930087) (← links)
- Class cover catch digraphs for latent class discovery in gene expression monitoring by DNA microarrays (Q951958) (← links)
- Relative density of the random \(R\)-factor proximity catch digraph for testing spatial patterns of segregation and association (Q959283) (← links)
- Extension of one-dimensional proximity regions to higher dimensions (Q991185) (← links)
- The distribution of the domination number of class cover catch digraphs for non-uniform one-dimensional data (Q998418) (← links)
- A CLT for a one-dimensional class cover problem (Q1003427) (← links)
- Characterizing the scale dimension of a high-dimensional classification problem (Q1856632) (← links)
- A SLLN for a one-dimensional class cover problem (Q1871304) (← links)
- An investigation of new graph invariants related to the domination number of random proximity catch digraphs (Q2276421) (← links)
- A new family of proximity graphs: class cover catch digraphs (Q2506361) (← links)
- The use of domination number of a random proximity catch digraph for testing spatial patterns of segregation and association (Q2573988) (← links)
- Domination number of an interval catch digraph family and its use for testing uniformity (Q5222209) (← links)
- GEOMETRIC PROXIMITY GRAPHS FOR IMPROVING NEAREST NEIGHBOR METHODS IN INSTANCE-BASED LEARNING AND DATA MINING (Q5311630) (← links)
- A new family of random graphs for testing spatial segregation (Q5421209) (← links)