• TUCS Publication Series
• How to Publish in TUCS Series
• Publication Search
• Publication Graph
• Publication Input
• Publication Input Guide
• JuFo Browser

The Parallel Complexity of Signed Graphs: Decidability and an Improved Algorithm

Artiom Alhazov, Ion Petre, Vladimir Rogojin, The Parallel Complexity of Signed Graphs: Decidability and an Improved Algorithm. Theoretical Computer Science , 2009.

BibTeX entry:

@ARTICLE{jAlPeRo09a,
  title = {The Parallel Complexity of Signed Graphs: Decidability and an Improved Algorithm},
  author = {Alhazov, Artiom and Petre, Ion and Rogojin, Vladimir},
  journal = {Theoretical Computer Science},
  year = {2009},
}

Belongs to TUCS Research Unit(s): Computational Biomodeling Laboratory (Combio Lab)

Publication Forum rating of this publication: level 2

Edit publication