## Abstract In 1978 Woodall [6] conjectured the following: in a planar digraph the size of a shortest cycle is equal to the maximum cardinality of a collection of disjoint tranversals of cycles. We prove that this conjecture is true when the digraph is seriesβparallel. In fact, we prove a stronger
A note on the characterization of the max and min operators
β Scribed by William Voxman; Roy Goetschel
- Publisher
- Elsevier Science
- Year
- 1983
- Tongue
- English
- Weight
- 277 KB
- Volume
- 30
- Category
- Article
- ISSN
- 0020-0255
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
This paper investigates the complexity of the min-max and min-max regret assignment problems both in the discrete scenario and interval data cases. We show that these problems are strongly NP-hard for an unbounded number of scenarios. We also show that the interval data min-max regret assignment pro
## Abstract The aim of this note is to study the spectral properties of the LUECKE's class __R__ of operators __T__ such that β(__T β zI__)^β1^β=1/__d__(__z, W__(__T__)) for all __z__β__CLW__(__T__), where __CLW__(__T__) is the closure of the numerical range __W__(__T__) of __T__ and __d__(__z, W__