Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Author="Kashem, Md. Abul"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
An optimal parallel algorithm for
c
-vertex-ranking of trees
Md. Abul Kashem
,
M. Ziaur Rahman
Information Processing Letters
92
(4), 2004, pp. 179-184
Algorithms for solving the symmetry number problem on trees
Pradipta Prometheus Mitra
,
Muhammad Arshad Ul Abedin
,
Md. Abul Kashem
Information Processing Letters
91
(4), 2004, pp. 163-169
An optimal parallel algorithm for
c
-vertex-ranking of trees
Md. Abul Kashem
,
M. Ziaur Rahman
Lecture Notes in Computer Science
2906
, 2003, pp. 464-473
Algorithms for generalized vertex-rankings of partial
k
-trees
Md. Abul Kashem
,
Xiao Zhou
,
Takao Nishizeki
Theoretical Computer Science
240
(2), 2000, pp. 407-427
An
NC
parallel algorithm for generalized vertex-rankings of partial
k
-trees
Md. Abul Kashem
,
Xiao Zhou
,
Takao Nishizeki
Proceedings of the 3rd International IEEE Symposium on Parallel Architectures, Algorithms and Networks, I-SPAN'97 (Taipei, Taiwan, December 18-20, 1997)
, 1997, pp. 105-111
Generalized vertex-rankings of partial
k
-trees
Md. Abul Kashem
,
Xiao Zhou
,
Takao Nishizeki
Lecture Notes in Computer Science
1276
, 1997, pp. 212-221