Inclusion-exclusion algorithms for counting set partitions
Författare
Summary, in English
Avdelning/ar
- Institutionen för datavetenskap
- Computer Science
- Parallella System
Publiceringsår
2006
Språk
Engelska
Sidor
575-582
Publikation/Tidskrift/Serie
2006 47th Annual IEEE Conference on Foundations of Computer Science
Dokumenttyp
Konferensbidrag
Förlag
IEEE - Institute of Electrical and Electronics Engineers Inc.
Ämne
- Computer Science
Nyckelord
- polynomial space approximation
- bin packing
- Hamiltonian subgraph
- bounded component spanning forest
- chromatic number
- domatic number
- inclusion-exclusion algorithm
- counting set partition
Conference name
2006 47th Annual IEEE Conference on Foundations of Computer Science
Conference date
2006-10-21 - 2006-10-24
Conference place
Berkeley, CA, United States
Status
Published
ISBN/ISSN/Övrigt
- ISBN: 0-7695-2720-5