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

Tutkimustuotos: Lehtiartikkeli › Artikkeli › Tieteellinen › vertaisarvioitu

3 Sitaatiot (Scopus)

Alkuperäiskieli	Ei tiedossa
Sivut	2308–2315
Julkaisu	Theoretical Computer Science
Vuosikerta	410
Numero	24-25
DOI - pysyväislinkit	https://doi.org/10.1016/j.tcs.2009.02.028
Tila	Julkaistu - 2009
OKM-julkaisutyyppi	A1 Julkaistu artikkeli, soviteltu

Pääsy asiakirjaan

@article{aa94e274e4754a77bd535babd7074ce2,

title = "The Parallel Complexity of Signed Graphs: Decidability and an Improved Algorithm",

author = "Artiom Alhazov and Ion Petre and Vladimir Rogojin",

year = "2009",

doi = "10.1016/j.tcs.2009.02.028",

language = "Odefinierat/ok{\"a}nt",

volume = "410",

pages = "2308–2315",

journal = "Theoretical Computer Science",

issn = "0304-3975",

publisher = "Elsevier",

number = "24-25",

}

TY - JOUR

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

AU - Alhazov, Artiom

AU - Petre, Ion

AU - Rogojin, Vladimir

PY - 2009

Y1 - 2009

U2 - 10.1016/j.tcs.2009.02.028

DO - 10.1016/j.tcs.2009.02.028

M3 - Artikel

SN - 0304-3975

VL - 410

SP - 2308

EP - 2315

JO - Theoretical Computer Science

JF - Theoretical Computer Science

IS - 24-25

ER -