Crossref
Treewidth and Minimum Fill-in on d-Trapezoid Graphs
Journal of Graph Algorithms and Applications · 1998
DOI: 10.7155/jgaa.00008 ↗Kurz gefasst
Fachartikel in der Zeitschrift Journal of Graph Algorithms and Applications, 1998. Verfasst von Hans L. Bodlaender und 3 weiteren Autor:innen. Die Arbeit wurde bisher 36-mal zitiert (Crossref).
Abstract (Originalsprache)
Kein Abstract verfügbar.
Zitieren
APA
Bodlaender, H. L., Kloks, T., Kratsch, D., & Müller, H. (1998). Treewidth and Minimum Fill-in on d-Trapezoid Graphs. Journal of Graph Algorithms and Applications. https://doi.org/10.7155/jgaa.00008
Vancouver
Bodlaender HL, Kloks T, Kratsch D, Müller H. Treewidth and Minimum Fill-in on d-Trapezoid Graphs. Journal of Graph Algorithms and Applications. 1998. doi:10.7155/jgaa.00008
BibTeX
@article{Bodlaender1998,
author = {Bodlaender, Hans L. and Kloks, Ton and Kratsch, Dieter and Müller, Haiko},
title = {Treewidth and Minimum Fill-in on d-Trapezoid Graphs},
journal = {Journal of Graph Algorithms and Applications},
year = {1998},
doi = {10.7155/jgaa.00008}
}
EUVIMED