Recommendations
Cites work
- scientific article; zbMATH DE number 4095497 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- A characterization of interval catch digraphs
- A digraph represented by a family of boxes or spheres
- An efficient algorithm for finding a two-pair, and its applications
- Interval digraphs: An analogue of interval graphs
- On kernels and semikernels of digraphs
- Optimizing weakly triangulated graphs
- Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
Cited in
(18)- Gender-aware facility location in multi-gender world
- Chronological Orderings of Interval Digraph
- A characterization of interval catch digraphs
- On some subclasses of interval catch digraphs
- Domination number of an interval catch digraph family and its use for testing uniformity
- Intersection representation of digraphs in trees with few leaves
- The distribution of the relative arc density of a family of interval catch digraph based on uniform data
- On the kernel and related problems in interval digraphs
- Uniquely restricted matchings in interval graphs
- Proper and unit bitolerance orders and graphs
- Max point-tolerance graphs
- Classes of intersection digraphs with good algorithmic properties
- Homogeneously Representable Interval Bigraphs
- On the distribution of the domination number for random class cover catch digraphs
- A note on the recognition of nested graphs
- scientific article; zbMATH DE number 434883 (Why is no real title available?)
- The distribution of the domination number of class cover catch digraphs for non-uniform one-dimensional data
- Representing digraphs using intervals or circular arcs
This page was built for publication: Algorithms for interval catch digraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1329814)
