Algorithmic Aspects of Neighborhood Numbers
✍ Scribed by Chang, Gerard J.; Farber, Martin; Tuza, Zsolt
- Book ID
- 118199385
- Publisher
- Society for Industrial and Applied Mathematics
- Year
- 1993
- Tongue
- English
- Weight
- 858 KB
- Volume
- 6
- Category
- Article
- ISSN
- 0895-4801
- DOI
- 10.1137/0406002
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
The amalgamation of leaf-labeled trees into a single (super)tree that "displays" each of the input trees is an important problem in classification. We discuss various approaches to this problem and show that a simple and well-known polynomialtime algorithm can be used to solve this problem whenever
One of the most crucial steps in the design of embedded systems is hardware/software partitioning, that is, deciding which components of the system should be implemented in hardware and which ones in software. Most formulations of the hardware/software partitioning problem are NP-hard, so the majori
ects of Combinatorics ects of Combinatorics wi!J be bia, Canada, ay 1'7-21, 'hW6. y the Simon Fraser ersity of Victoria and the University of stish Columbia. speakers are tentatively schedul ster sessions will be arrar-bed.