Fast exponential-time algorithms for the forest counting and the Tutte polynomial computation in graph classes
- Conference Paper
Journal / seriesInternational Journal of Foundations of Computer Science
Pages / Article No.
Subjectchordal graph; exponential-time algorithm; forest; regular graph; Tutte polynomial; unit interval graph
NotesReceived 25 April 2007, Accepted 23 October 2007.
MoreShow all metadata