Steiner problem in Halin networks (Q1092013): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: An integer linear programming approach to the steiner problem in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3042417 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterization and Recognition of Partial 3-Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Halin graphs and the travelling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The steiner problem in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Une heuristique pour le problème de l'arbre de Steiner / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3026711 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Steiner's problem in graphs and its implications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5622228 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel concepts in graph theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fast algorithm for Steiner trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4130999 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3907583 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The computation of nearly minimal Steiner trees in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm for the steiner problem in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3322145 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3874241 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3663321 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Steiner trees, partial 2–trees, and minimum IFI networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Steiner problem in networks: A survey / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 10:52, 18 June 2024

scientific article
Language Label Description Also known as
English
Steiner problem in Halin networks
scientific article

    Statements

    Steiner problem in Halin networks (English)
    0 references
    0 references
    1987
    0 references
    A Halin network is obtained from a planar embedding of a tree T with no vertices of degree 2 by adding new edges to join the consecutive leaves of T to form a cycle. The author gives a linear time algorithm for the Steiner problem in Halin networks.
    0 references
    0 references
    optimization
    0 references
    Halin network
    0 references
    linear time algorithm
    0 references
    Steiner problem
    0 references