The parallel complexity of signed graphs: Decidability results and an improved algorithm

DOI10.1016/j.tcs.2009.02.028zbMath1167.68022OpenAlexW1979611609MaRDI QIDQ1019708

Ion Petre, Artiom Alhazov, Vladimir Rogozhin

Publication date: 4 June 2009

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2009.02.028

zbMATH Keywords

algorithmdecidabilityparallel complexitysigned graphsciliatesparallel gene assembly

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Parallel algorithms in computer science (68W10) Cell biology (92C37) Graph algorithms (graph-theoretic aspects) (05C85) Genetics and epigenetics (92D10) Signed and weighted graphs (05C22)

Related Items (2)

Graph reductions, binary rank, and pivots in gene assembly ⋮ Computing the graph-based parallel complexity of gene assembly

Cites Work

• Parallelism in gene assembly
• Parallel complexity of signed graphs for gene assembly in ciliates
• Computing the graph-based parallel complexity of gene assembly
• Computation in living cells. Gene assembly in ciliates
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The parallel complexity of signed graphs: Decidability results and an improved algorithm