Symbolic Coloured SCC Decomposition
The result's identifiers
Result code in 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>
Result on the web
<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>
Alternative languages
Result language
angličtina
Original language name
Symbolic Coloured SCC Decomposition
Original language description
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.
Czech name
—
Czech description
—
Classification
Type
D - Article in proceedings
CEP classification
—
OECD FORD branch
10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
Result continuities
Project
—
Continuities
S - Specificky vyzkum na vysokych skolach
Others
Publication year
2021
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Article name in the collection
Tools and Algorithms for the Construction and Analysis of Systems, 27th International Conference, TACAS 2021
ISBN
9783030720124
ISSN
0302-9743
e-ISSN
—
Number of pages
20
Pages from-to
64-83
Publisher name
Springer Nature
Place of publication
Neuveden
Event location
Luxembourg
Event date
Apr 1, 2021
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
—