On the distribution of the domination number for random class cover catch digraphs
DOI10.1016/S0167-7152(01)00129-8zbMATH Open0999.05082OpenAlexW2117772622MaRDI QIDQ158221FDOQ158221
Jason DeVinney, Carey E. Priebe, Jason G. Devinney, David J. Marchette, David J. Marchette, Carey E. Priebe
Publication date: December 2001
Published in: Statistics \& Probability Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0167-7152(01)00129-8
Directed graphs (digraphs), tournaments (05C20) Random graphs (graph-theoretic aspects) (05C80) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Combinatorial probability (60C05)
Cites Work
- A characterization of interval catch digraphs
- Analysis of a greedy heuristic for finding small dominating sets in graphs
- Approximation algorithms for combinatorial problems
- Algorithms for interval catch digraphs
- Inequalities for minimal covering sets in set systems of given rank
- Approximation algorithms for the class cover problem
- Sphere-of-attraction graphs
- Interval digraphs: An analogue of interval graphs
- A Greedy Heuristic for the Set-Covering Problem
- Approximation Algorithms for the Set Covering and Vertex Cover Problems
- Topics in Intersection Graph Theory
- On Random Intersection Graphs: The Subgraph Problem
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (21)
- Characterizing the scale dimension of a high-dimensional classification problem
- A SLLN for a one-dimensional class cover problem
- Domination number of an interval catch digraph family and its use for testing uniformity
- On the Distribution of the Domination Number of a New Family of Parametrized Random Digraphs
- The distribution of the relative arc density of a family of interval catch digraph based on uniform data
- A new family of proximity graphs: class cover catch digraphs
- The use of domination number of a random proximity catch digraph for testing spatial patterns of segregation and association
- Comparison of relative density of two random geometric digraph families in testing spatial clustering
- Extension of one-dimensional proximity regions to higher dimensions
- An investigation of new graph invariants related to the domination number of random proximity catch digraphs
- Edge density of new graph types based on a random digraph family
- A new family of random graphs for testing spatial segregation
- Spatial Clustering Tests Based on the Domination Number of a New Random Digraph Family
- Classification using proximity catch digraphs
- GEOMETRIC PROXIMITY GRAPHS FOR IMPROVING NEAREST NEIGHBOR METHODS IN INSTANCE-BASED LEARNING AND DATA MINING
- A general SLLN for the one-dimensional class cover problem
- Class cover catch digraphs for latent class discovery in gene expression monitoring by DNA microarrays
- Relative density of the random \(R\)-factor proximity catch digraph for testing spatial patterns of segregation and association
- A CLT for a one-dimensional class cover problem
- The distribution of the domination number of class cover catch digraphs for non-uniform one-dimensional data
- rcccd
This page was built for publication: On the distribution of the domination number for random class cover catch digraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q158221)
