"An Efficient Algorithm to Count Tree-Like Graphs with a Given Number of ..."

Naveed Ahmed Azam, Aleksandar Shurbevski, Hiroshi Nagamochi (2020)

> Home

Details and statistics

DOI: 10.3390/E22090923

access: open

type: Journal Article

metadata version: 2021-09-16

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/entropy/AzamSN20
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/entropy/AzamSN20
Naveed Ahmed Azam, Aleksandar Shurbevski, Hiroshi Nagamochi:
An Efficient Algorithm to Count Tree-Like Graphs with a Given Number of Vertices and Self-Loops. Entropy 22(9): 923 (2020)

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.