On the distribution of the domination number for random class cover catch digraphs
type: Item
instance of: scholarly article
published in: Statistics \& Probability Letters
volume: 55
issue: 3
page(s): 239-246
publication date: 2001-12-01T00:00:00Z
publication date: 2002-09-05T00:00:00Z
author: Carey E. Priebe
author: Jason G. Devinney
author: David J. Marchette
author: Jason DeVinney
title: On the distribution of the domination number for random class cover catch digraphs
zbMATH Open document ID: 0999.05082
Mathematics Subject Classification ID: 05C69
Mathematics Subject Classification ID: 05C20
Mathematics Subject Classification ID: 05C80
Mathematics Subject Classification ID: 60C05
zbMATH DE Number: 1796626
zbMATH Keywords: intersection digraphs
zbMATH Keywords: distribution
zbMATH Keywords: domination number
zbMATH Keywords: random interval catch digraphs
MaRDI profile type: Publication
cites work: Q3682518
cites work: Q4398864
cites work: Approximation algorithms for the class cover problem
cites work: Q4350166
cites work: A Greedy Heuristic for the Set-Covering Problem
cites work: Q5629053
cites work: Q3214706
cites work: Q4328185
cites work: Q4368729
cites work: Q4368728
cites work: Approximation Algorithms for the Set Covering and Vertex Cover Problems
cites work: Q4519896
cites work: Approximation algorithms for combinatorial problems
cites work: On Random Intersection Graphs: The Subgraph Problem
cites work: Q4142699
cites work: Topics in Intersection Graph Theory
cites work: Sphere-of-attraction graphs
cites work: Analysis of a greedy heuristic for finding small dominating sets in graphs
cites work: A characterization of interval catch digraphs
cites work: Algorithms for interval catch digraphs
cites work: Interval digraphs: An analogue of interval graphs
cites work: Inequalities for minimal covering sets in set systems of given rank
full work available at URL: s0167-7152(01)00129-8
OpenAlex ID: W2117772622
DOI: 10.1016/S0167-7152(01)00129-8
description: scientific article; zbMATH DE number 1796626