"The complexity of counting graph homomorphisms."

Martin E. Dyer, Catherine S. Greenhill (2000)

> Home

Details and statistics

DOI: 10.1002/1098-2418(200010/12)17:3/4<260::AID-RSA5>3.0.CO;2-W

access: closed

type: Journal Article

metadata version: 2025-03-03

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/rsa/DyerG00
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/rsa/DyerG00
Martin E. Dyer, Catherine S. Greenhill:
The complexity of counting graph homomorphisms. Random Struct. Algorithms 17(3-4): 260-289 (2000)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.