An Ant Colony Optimisation Approach to the Densest k-Subgraph Problem.
Resource URI: https://dblp.l3s.de/d2r/resource/publications/conf/synasc/TasnadiG22
Home
|
Example Publications
Property
Value
dcterms:
bibliographicCitation
<
http://dblp.uni-trier.de/rec/bibtex/conf/synasc/TasnadiG22
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/No%E2%88%9A%C2%A9mi_Gask%E2%88%9A%E2%89%A5
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Zolt%E2%88%9A%C2%B0n_Tasn%E2%88%9A%C2%B0di
>
foaf:
homepage
<
http://dx.doi.org/doi.org%2F10.1109%2FSYNASC57785.2022.00039
>
foaf:
homepage
<
https://doi.org/10.1109/SYNASC57785.2022.00039
>
dc:
identifier
DBLP conf/synasc/TasnadiG22
(xsd:string)
dc:
identifier
DOI doi.org%2F10.1109%2FSYNASC57785.2022.00039
(xsd:string)
dcterms:
issued
2022
(xsd:gYear)
rdfs:
label
An Ant Colony Optimisation Approach to the Densest k-Subgraph Problem.
(xsd:string)
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/No%E2%88%9A%C2%A9mi_Gask%E2%88%9A%E2%89%A5
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Zolt%E2%88%9A%C2%B0n_Tasn%E2%88%9A%C2%B0di
>
swrc:
pages
208-211
(xsd:string)
dcterms:
partOf
<
https://dblp.l3s.de/d2r/resource/publications/conf/synasc/2022
>
owl:
sameAs
<
http://bibsonomy.org/uri/bibtexkey/conf/synasc/TasnadiG22/dblp
>
owl:
sameAs
<
http://dblp.rkbexplorer.com/id/conf/synasc/TasnadiG22
>
rdfs:
seeAlso
<
http://dblp.uni-trier.de/db/conf/synasc/synasc2022.html#TasnadiG22
>
rdfs:
seeAlso
<
https://doi.org/10.1109/SYNASC57785.2022.00039
>
swrc:
series
<
https://dblp.l3s.de/d2r/resource/conferences/synasc
>
dc:
title
An Ant Colony Optimisation Approach to the Densest k-Subgraph Problem.
(xsd:string)
dc:
type
<
http://purl.org/dc/dcmitype/Text
>
rdf:
type
swrc:InProceedings
rdf:
type
foaf:Document