Fast exponential-time algorithms for the forest counting and the Tutte polynomial computation in graph classes
METADATA ONLY
Loading...
Author / Producer
Date
2009-02
Publication Type
Conference Paper
ETH Bibliography
yes
Citations
Altmetric
METADATA ONLY
Data
Rights / License
Permanent link
Publication status
published
External links
Editor
Book title
Volume
20 (1)
Pages / Article No.
25 - 44
Publisher
World Scientific
Event
13th Computing: The Australasian Theory Symposium (CATS 2007)
Edition / version
Methods
Software
Geographic location
Date collected
Date created
Subject
chordal graph; exponential-time algorithm; forest; regular graph; Tutte polynomial; unit interval graph
Organisational unit
Notes
Received 25 April 2007, Accepted 23 October 2007.