An Efficient Algorithm to Count Tree-Like Graphs with a Given Number of Vertices and Self-Loops.
Resource URI: https://dblp.l3s.de/d2r/resource/publications/journals/entropy/AzamSN20
Home
|
Example Publications
Property
Value
dcterms:
bibliographicCitation
<
http://dblp.uni-trier.de/rec/bibtex/journals/entropy/AzamSN20
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Aleksandar_Shurbevski
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Hiroshi_Nagamochi
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Naveed_Ahmed_Azam
>
foaf:
homepage
<
http://dx.doi.org/doi.org%2F10.3390%2Fe22090923
>
foaf:
homepage
<
https://doi.org/10.3390/e22090923
>
dc:
identifier
DBLP journals/entropy/AzamSN20
(xsd:string)
dc:
identifier
DOI doi.org%2F10.3390%2Fe22090923
(xsd:string)
dcterms:
issued
2020
(xsd:gYear)
swrc:
journal
<
https://dblp.l3s.de/d2r/resource/journals/entropy
>
rdfs:
label
An Efficient Algorithm to Count Tree-Like Graphs with a Given Number of Vertices and Self-Loops.
(xsd:string)
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Aleksandar_Shurbevski
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Hiroshi_Nagamochi
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Naveed_Ahmed_Azam
>
swrc:
number
9
(xsd:string)
swrc:
pages
923
(xsd:string)
owl:
sameAs
<
http://bibsonomy.org/uri/bibtexkey/journals/entropy/AzamSN20/dblp
>
owl:
sameAs
<
http://dblp.rkbexplorer.com/id/journals/entropy/AzamSN20
>
rdfs:
seeAlso
<
http://dblp.uni-trier.de/db/journals/entropy/entropy22.html#AzamSN20
>
rdfs:
seeAlso
<
https://doi.org/10.3390/e22090923
>
dc:
title
An Efficient Algorithm to Count Tree-Like Graphs with a Given Number of Vertices and Self-Loops.
(xsd:string)
dc:
type
<
http://purl.org/dc/dcmitype/Text
>
rdf:
type
swrc:Article
rdf:
type
foaf:Document
swrc:
volume
22
(xsd:string)