23 citations · 34 across the 4 of their papers we have counts for
4 papers
Exact counting of Euler Tours for Graphs of Bounded Treewidth
Prasad Chebolu, Mary Cryan, Russell Martin
In this paper we give a simple polynomial-time algorithm to exactly count the number of Euler Tours (ETs) of any Eulerian graph of bounded treewidth. The problems of counting ETs a…
The Complexity of Approximately Counting Stable Roommate Assignments
Prasad Chebolu, Leslie Ann Goldberg, Russell Martin
We investigate the complexity of approximately counting stable roommate assignments in two models: (i) the -attribute model, in which the preference lists are determined by dot…
Exact counting of Euler Tours for generalized series-parallel graphs
Prasad Chebolu, Mary Cryan, Russell Martin
We give a simple polynomial-time algorithm to exactly count the number of Euler Tours (ETs) of any Eulerian generalized series-parallel graph, and show how to adapt this algorithm…
The Complexity of Approximately Counting Stable Matchings
Prasad Chebolu, Leslie Ann Goldberg, Russell Martin
We investigate the complexity of approximately counting stable matchings in the -attribute model, where the preference lists are determined by dot products of "preference vector…