Crossref
Highly non-concurrent longest paths in lattices
TURKISH JOURNAL OF MATHEMATICS · 2016 · 40 · 21-31
DOI: 10.3906/mat-1502-32 ↗Kurz gefasst
Fachartikel in der Zeitschrift TURKISH JOURNAL OF MATHEMATICS, 2016. Verfasst von Yasir BASHIR und 2 weiteren Autor:innen. Die Arbeit wurde bisher 2-mal zitiert (Crossref) und nennt 21 Literaturangaben.
Abstract (Originalsprache)
Kein Abstract verfügbar.
Zitieren
APA
BASHIR, Y., NADEEM, F., & SHABBIR, A. (2016). Highly non-concurrent longest paths in lattices. TURKISH JOURNAL OF MATHEMATICS, 40, 21-31. https://doi.org/10.3906/mat-1502-32
Vancouver
BASHIR Y, NADEEM F, SHABBIR A. Highly non-concurrent longest paths in lattices. TURKISH JOURNAL OF MATHEMATICS. 2016;40:21-31. doi:10.3906/mat-1502-32
BibTeX
@article{BASHIR2016,
author = {BASHIR, Yasir and NADEEM, Faisal and SHABBIR, Ayesha},
title = {Highly non-concurrent longest paths in lattices},
journal = {TURKISH JOURNAL OF MATHEMATICS},
year = {2016},
volume = {40},
pages = {21--31},
doi = {10.3906/mat-1502-32}
}
EUVIMED