 |
Fakultät für Informatik - Technische Universität MünchenLehrstuhl für Effiziente Algorithmen |
 |
Die bibliographische Datenbank LEABib
Suchen •
Liste der Journale •
Liste der Serien •
Liste der Konferenzen •
Ausgewählte Publikationen  [1]
|
Hilfe 
|
 |
|
| Suche: Citkey="Battaglia-Grossi-Scutella/12" |
|
Consecutive ones property and PQ-trees for multisets: Hardness of counting their orderings
Giovanni Battaglia, Roberto Grossi, Noemi Scutellà
Information and Computation 219 , 2012, pp. 58-70
| Editors | Albert R. Meyer | |
| Publisher: | Elsevier B.V. | |
| Address: | Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-San Louis | |
| Keywords: | sequences with repeated symbols, multisets, consecutive ones property, counting permutations, pq-trees, complexity | |
| URL: |
http://www.sciencedirect.com/science/article/pii/S0890540112001289 | |
|
|
|
|