Algorithms and Computation
From MaRDI portal
Publication:5897941
DOI10.1007/11602613zbMath1152.68481OpenAlexW2304246803MaRDI QIDQ5897941
Sven Kosub, Moritz G. Maaß, Stefan Eckhardt, Hanjo Täubig, Sebastian Wernicke
Publication date: 14 November 2006
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11602613
Trees (05C05) Extremal problems in graph theory (05C35) Graph theory (including graph drawing) in computer science (68R10) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Distance in graphs (05C12) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
This page was built for publication: Algorithms and Computation
