Pages that link to "Item:Q2259027"

The following pages link to Algorithmic aspects of Steiner convexity and enumeration of Steiner trees (Q2259027):

Displaying 11 items.

• The role of Steiner hulls in the solution to Steiner tree problems (Q1179758) (← links)
• Steiner trees with \(n\) terminals among \(n+1\) nodes (Q1197890) (← links)
• The Steiner tree problem. I: Formulations, compositions and extensions and extension of facets (Q1330902) (← links)
• Parameterized algorithms for Steiner tree and dominating set: bounding the leafage by the vertex leafage (Q2154102) (← links)
• Extending the kernel for planar Steiner tree to the number of Steiner vertices (Q2408201) (← links)
• Combination algorithms for Steiner tree variants (Q2700384) (← links)
• Generating all the Steiner trees and computing Steiner intervals for a fixed number of terminals (Q2840557) (← links)
• Constrained spanning, Steiner trees and the triangle inequality (Q3407629) (← links)
• (Q3519877) (← links)
• (Q5092436) (← links)
• Characterizations of graph classes via convex geometries: a survey (Q6648266) (← links)