Generalized steiner problem in outerplanar networks
Copyright policy )Generalized steiner problem in outerplanar networks
The generalized Steiner problem in a network is considered. The generalization consists in the requirement that some vertices satisfy certain pairwise (vertex or edge) connectivity constraints. The general problem was known to be NP-complete, but for the case when the underlying network is outerplanar and the subnetwork is required to be biconnected (or edge biconnected), a linear time algorithm is presented.
- University of Copenhagen Denmark
Extremal problems in graph theory, generalized Steiner problem, outerplanar network, Analysis of algorithms and problem complexity, linear time algorithm, connectivity constraints, Programming involving graphs or networks
Extremal problems in graph theory, generalized Steiner problem, outerplanar network, Analysis of algorithms and problem complexity, linear time algorithm, connectivity constraints, Programming involving graphs or networks
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).17 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.Average 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!