SIGN IN
SIGN UP
On counting homomorphisms to directed acyclic graphs
Full Text:
Pdf
Buy this Article
Authors:
Martin Dyer
University of Leeds, Leeds, United Kingdom
Leslie Ann Goldberg
University of Liverpool, Liverpool, United Kingdom
Mike Paterson
University of Warwick, Coventry, United Kingdom
Published in:
· Journal
Journal of the ACM (JACM)
JACM Homepage
archive
Volume 54 Issue 6, December 2007
ACM
New York, NY
, USA
table of contents
doi>
10.1145/1314690.1314691
2007 Article
Bibliometrics
· Downloads (6 Weeks): 7
· Downloads (12 Months): 59
· Citation Count: 10
Tools and Resources
Buy this Article
Request Permissions
TOC Service:
Email
RSS
Save to Binder
Export Formats:
BibTeX
EndNote
ACM Ref
Share:
|
Tags:
algorithms
counting
directed acyclic graphs
general
homomorphisms
theory
Feedback
|
Switch to
single page view
(no tabs)
**Javascript is not enabled and is required for the "tabbed view" or switch to the
single page view
**
Powered by
The ACM Guide to Computing Literature
All Tags
Export Formats
Save to Binder