Irredundant intervals
From MaRDI portal
Abstract: This expository note presents simplifications of a theorem due to GyH{o}ri and an algorithm due to Franzblau and Kleitman: Given a family of intervals on a linearly ordered set of elements, we can construct in steps an irredundant subfamily having maximum cardinality, as well as a generating family having minimum cardinality. The algorithm is of special interest because it solves a problem analogous to finding a maximum independent set, but on a class of objects that is more general than a matroid. This note is also a complete, runnable computer program, which can be used for experiments in conjunction with the public-domain software of {sl The Stanford GraphBase}.
Recommendations
Cited in
(7)- A fast algorithm for finding interlocking sets
- Finding minimum generators of path systems
- Pushdown-reduce: An algorithm for connectivity augmentation and poset covering problems
- Jump number of two-directional orthogonal ray graphs
- scientific article; zbMATH DE number 3851100 (Why is no real title available?)
- Maximum independent set for intervals by divide and conquer with pruning
- scientific article; zbMATH DE number 1136097 (Why is no real title available?)
This page was built for publication: Irredundant intervals
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5463365)