Symbolic Coloured SCC Decomposition

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216224%3A14330%2F21%3A00121404" target="_blank" >RIV/00216224:14330/21:00121404 - isvavai.cz</a>

Výsledek na webu

<a href="https://doi.org/10.1007/978-3-030-72013-1_4" target="_blank" >https://doi.org/10.1007/978-3-030-72013-1_4</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1007/978-3-030-72013-1_4" target="_blank" >10.1007/978-3-030-72013-1_4</a>

Jazyk výsledku

angličtina

Název v původním jazyce

Symbolic Coloured SCC Decomposition

Popis výsledku v původním jazyce

Problems arising in many scientific disciplines are often modelled using edge-coloured directed graphs. These can be enormous in the number of both vertices and colours. Given such a graph, the original problem frequently translates to the detection of the graph's strongly connected components, which is challenging at this scale. We propose a new, symbolic algorithm that computes all the monochromatic strongly connected components of an edge-coloured graph. In the worst case, the algorithm performs $O(pcdot ncdotlog n)$ symbolic steps, where $p$ is the number of colours and $n$ the number of vertices. We evaluate the algorithm using an experimental implementation based on Binary Decision Diagrams (BDDs) and large (up to $2^{48}$) coloured graphs produced by models appearing in systems biology.

Název v anglickém jazyce

Symbolic Coloured SCC Decomposition

Popis výsledku anglicky

Problems arising in many scientific disciplines are often modelled using edge-coloured directed graphs. These can be enormous in the number of both vertices and colours. Given such a graph, the original problem frequently translates to the detection of the graph's strongly connected components, which is challenging at this scale. We propose a new, symbolic algorithm that computes all the monochromatic strongly connected components of an edge-coloured graph. In the worst case, the algorithm performs $O(pcdot ncdotlog n)$ symbolic steps, where $p$ is the number of colours and $n$ the number of vertices. We evaluate the algorithm using an experimental implementation based on Binary Decision Diagrams (BDDs) and large (up to $2^{48}$) coloured graphs produced by models appearing in systems biology.

Druh

D - Stať ve sborníku

CEP obor

—

OECD FORD obor

10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Projekt

—

Návaznosti

S - Specificky vyzkum na vysokych skolach

Rok uplatnění

2021

Kód důvěrnosti údajů

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Název statě ve sborníku

Tools and Algorithms for the Construction and Analysis of Systems, 27th International Conference, TACAS 2021

ISBN

9783030720124

ISSN

0302-9743

e-ISSN

—

Počet stran výsledku

20

Strana od-do

64-83

Název nakladatele

Springer Nature

Místo vydání

Neuveden

Místo konání akce

Luxembourg

Datum konání akce

1. 4. 2021

Typ akce podle státní příslušnosti

WRD - Celosvětová akce

Kód UT WoS článku

—