Pages that link to "Item:Q1329814"
From MaRDI portal
The following pages link to Algorithms for interval catch digraphs (Q1329814):
Displaying 14 items.
- On the distribution of the domination number for random class cover catch digraphs (Q158221) (← links)
- Max point-tolerance graphs (Q344833) (← links)
- The distribution of the relative arc density of a family of interval catch digraph based on uniform data (Q715495) (← links)
- The distribution of the domination number of class cover catch digraphs for non-uniform one-dimensional data (Q998418) (← links)
- Proper and unit bitolerance orders and graphs (Q1381846) (← links)
- Representing digraphs using intervals or circular arcs (Q1910520) (← links)
- Uniquely Restricted Matchings in Interval Graphs (Q3130447) (← links)
- (Q3301019) (← links)
- Homogeneously Representable Interval Bigraphs (Q3439038) (← links)
- Chronological Orderings of Interval Digraph (Q3439082) (← links)
- Intersection representation of digraphs in trees with few leaves (Q4719324) (← links)
- Domination number of an interval catch digraph family and its use for testing uniformity (Q5222209) (← links)
- On the kernel and related problems in interval digraphs (Q6103517) (← links)
- Classes of intersection digraphs with good algorithmic properties (Q6201028) (← links)
