ID-GBA: Subgraph Extension With Information Distance Guilt by Association in Complex Networks.

Obradovic P, Kovacevic V, Milosavljevic A, Petrosyan V

Open source

DOI
10.1109/access.2025.3622038
Published
2025
Container
IEEE access : practical innovations, open solutions
Publisher
Not recorded
Open access
yes

Credibility signals

limited evidence Score 45/100 under policy 1.0.0. This is a metadata assessment, not a judgment of the paper's conclusions.

Show all credibility signals

Cite this work

BibTeX

@article{allodium:10.1109/access.2025.3622038,
  title = {ID-GBA: Subgraph Extension With Information Distance Guilt by Association in Complex Networks.},
  author = {Obradovic P and Kovacevic V and Milosavljevic A and Petrosyan V},
  year = {2025},
  journal = {IEEE access : practical innovations, open solutions},
  doi = {10.1109/access.2025.3622038},
  url = {https://doi.org/10.1109/access.2025.3622038}
}

RIS

TY  - JOUR
TI  - ID-GBA: Subgraph Extension With Information Distance Guilt by Association in Complex Networks.
AU  - Obradovic P
AU  - Kovacevic V
AU  - Milosavljevic A
AU  - Petrosyan V
PY  - 2025
JO  - IEEE access : practical innovations, open solutions
DO  - 10.1109/access.2025.3622038
UR  - https://doi.org/10.1109/access.2025.3622038
ER  - 

APA

P, O., V, K., A, M., & V, P. (2025). ID-GBA: Subgraph Extension With Information Distance Guilt by Association in Complex Networks.. IEEE access : practical innovations, open solutions. https://doi.org/10.1109/access.2025.3622038

Source records