Year: 2025
Type: article
Abstract: MSP DAGs (short for minimal series-parallel digraphs) can be defined from the single vertex graph by applying the parallel composition and series composition. We prove an upper bound of 6 for the directed clique-width of MSP DAGs and show how a directed clique-width 6-expression can be found in linear time. Our 6-expression can be used to construct an MSP DAG G from its binary decomposition tree T(G) in linear time. We apply our bound on the directed clique-width to conclude a number of algorithmic consequences for MSP DAGs.
Source: Algorithms
DOI: 10.3390/a18060323
Authors: Frank Gurski, Ruzayn Quaddoura
Institutions: Heinrich Heine University Düsseldorf, Zarqa University
Language: English
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: gold
Estimated APC paid: $1,930
OpenAlex ID: W4410820214