On the Linear and Hereditary Discrepancies
✍ Scribed by Jiřı́ Matoušek
- Publisher
- Elsevier Science
- Year
- 2000
- Tongue
- English
- Weight
- 63 KB
- Volume
- 21
- Category
- Article
- ISSN
- 0195-6698
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
A distance-hereditary graph is a connected graph in which every induced path is isometric, i.e., the distance of any two vertices in an induced path equals their distance in the graph. We present a linear time labeling algorithm for the minimum cardinality connected r-dominating set and Steiner tree
A higher Performance than Verbal score commonly is interpreted a s indicating a more externalizing, action-oriented style, while those who display the reverse pattern of WAIS scores often are seen as better able to delay. Because very similar personality descriptions are developed from the Rorschach
The concept of well-hstribution with respect to weighted means was introduced for the interval [0, 1) by the author [4], [j], cf. also TICHY [7], [8] for a preparatory special case. Recently DRMOTA/TICHT [l] have generalized t h s concept to a compact metric space X. They have got first metric resul