Obiekt

Tytuł publikacji grupowej:

2024, nr 3, JTIT-artykuły

Abstrakt:

The paper proposes a modification of the existing distributed forward-backward algorithm for finding strongly connected components in directed graphs. The modification aims at improving the parallelism of the algorithm by increasing the branching factor while dividing the workload. Instead of randomly picking the pivot vertex, a heuristic technique is used which allows more sub-tasks to be generated, on average, for the subsequent step of the algorithm. The work describes suitable algorithm modifications and presents empirical results, proving suitability of the approach in question.

Numer:

3

Wydawca:

National Institute of Telecommunications

Identyfikator zasobu:

oai:bc.itl.waw.pl:2352 ; ISSN 1509-4553, on-line: ISSN 1899-8852

DOI:

10.26636/jtit.2024.3.1693

ISSN:

1509-4553

eISSN:

1899-8852

Źródło:

Journal of Telecommunications and Information Technology

Język:

ang

Licencja:

CC BY 4.0

Właściciel praw:

Instytut Łączności - Państwowy Instytut Badawczy