Skip to main navigation
Skip to search
Skip to main content
University of Edinburgh Research Explorer Home
Help & FAQ
Home
Research output
Profiles
Research units
Projects
Datasets
Prizes
Activities
Press/Media
Equipment
Search by expertise, name or affiliation
Exact counting of Euler Tours for Graphs of Bounded Treewidth
P. Chebolu,
M. Cryan
, R. Martin
School of Informatics
Laboratory for Foundations of Computer Science
Research output
:
Working paper
Overview
Fingerprint
Projects
(1)
Fingerprint
Dive into the research topics of 'Exact counting of Euler Tours for Graphs of Bounded Treewidth'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Computer Science
Polynomial Time Algorithm
100%
Classes
50%