
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Full Steiner tree problem, Analysis of algorithms and problem complexity, Evolutionary tree, Approximation algorithm, Approximation algorithms, Theoretical Computer Science, Graph theory (including graph drawing) in computer science, Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.), Approximation algorithmq17 68q25 68w25, MAX SNP-hard, Phylogenetic tree, NP-complete, Computer Science(all)
Full Steiner tree problem, Analysis of algorithms and problem complexity, Evolutionary tree, Approximation algorithm, Approximation algorithms, Theoretical Computer Science, Graph theory (including graph drawing) in computer science, Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.), Approximation algorithmq17 68q25 68w25, MAX SNP-hard, Phylogenetic tree, NP-complete, Computer Science(all)
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 46 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Top 10% | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Top 10% | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Top 10% |
