Greedy algorithm for edge-based nested community detection

Gera Imre and London András and Pluhár András: Greedy algorithm for edge-based nested community detection.
In: 2022 IEEE 2nd Conference on Information Technology and Data Science (CITDS). IEEE, Piscataway (NJ), pp. 86-91. (2022) ISBN 9781665496537; 9781665496520

[thumbnail of GeraLondonPluhar-IEEE.pdf] Text
GeraLondonPluhar-IEEE.pdf - Published Version
Closed access: Repository staff only

Download (349kB) | Request a copy
[thumbnail of 33203006_címlap_tartalom.pdf] Text
33203006_címlap_tartalom.pdf - Cover Image/Table of Contents
Closed access: Repository staff only

Download (200kB) | Request a copy
Creators:
Gera Imre MTMT
London András MTMT
Pluhár András MTMT
Item Type: Book Section
Date: 2022
Number of Pages: 6
Page Range: pp. 86-91
ISBN: 9781665496537; 9781665496520
Publisher: IEEE
Place of Publication: Piscataway (NJ)
Faculty/Unit: Faculty of Science and Informatics
Institution: University of Szeged (2000-)
Language: English
MTMT rekordazonosító: 33203006
DOI azonosító: https://doi.org/10.1109/CITDS54976.2022.9914051
Date Deposited: 2023. Apr. 06. 09:02
Last Modified: 2023. Apr. 06. 09:02
URI: http://publicatio.bibl.u-szeged.hu/id/eprint/26916

Actions (login required)

View Item View Item