Fast exponential-time algorithms for the forest counting and the Tutte polynomial computation in graph classes
Metadata only
Datum
2009-02Typ
- Conference Paper
ETH Bibliographie
yes
Altmetrics
Publikationsstatus
publishedExterne Links
Zeitschrift / Serie
International Journal of Foundations of Computer ScienceBand
Seiten / Artikelnummer
Verlag
World ScientificKonferenz
Thema
chordal graph; exponential-time algorithm; forest; regular graph; Tutte polynomial; unit interval graphAnmerkungen
Received 25 April 2007, Accepted 23 October 2007.ETH Bibliographie
yes
Altmetrics