On the minimum eccentricity shortest path problem
Copyright policy )On the minimum eccentricity shortest path problem
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
- University System of Ohio United States
- Kent State University United States
graph algorithms, Distance in graphs, Analysis of algorithms and problem complexity, minimum eccentricity shortest path, Approximation algorithms, \(k\)-Dominating Set, Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.), Graph algorithms (graph-theoretic aspects), Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.), minimum distortion embedding into the line, approximation algorithms, NP-complete problems, W[2]-hard problems
graph algorithms, Distance in graphs, Analysis of algorithms and problem complexity, minimum eccentricity shortest path, Approximation algorithms, \(k\)-Dominating Set, Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.), Graph algorithms (graph-theoretic aspects), Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.), minimum distortion embedding into the line, approximation algorithms, NP-complete problems, W[2]-hard problems
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).13 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.Average
Citations provided by BIP!Popularity provided by BIP!