A Geometric Approach to Acyclic Orientations
β Scribed by Richard Ehrenborg; Michael Slone
- Publisher
- Springer Netherlands
- Year
- 2009
- Tongue
- English
- Weight
- 263 KB
- Volume
- 26
- Category
- Article
- ISSN
- 0167-8094
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
The acyclic orientations of a graph are related to its chromatic polynomial, to its reliability, and to certain hyperplane arrangements. In this paper, an algorithm for listing the acyclic orientations of a graph is presented. The algorithm is shown to Ε½ . require O n time per acyclic orientation ge
A classi"er is called consistent with respect to a given set of class}labeled points if it correctly classi"es the set. We consider classi"ers de"ned by unions of local separators (e.g., polytopes) and propose algorithms for consistent classi"er reduction. The proposed approach yields a consistent r