Generating all the Steiner trees and computing Steiner intervals for a fixed number of terminals

DOI10.1016/j.endm.2009.11.053zbMath1268.05046OpenAlexW2001749541MaRDI QIDQ2840557

Mitre C. Dourado, Fábio Protti, Rodolfo A. de Oliveira

Publication date: 19 July 2013

Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.endm.2009.11.053

zbMATH Keywords

Steiner treeenumerative combinatoricsSteiner convexitystrong Steiner interval

Mathematics Subject Classification ID

Trees (05C05) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items

Algorithmic aspects of Steiner convexity and enumeration of Steiner trees

Cites Work

• Unnamed Item
• The Steiner tree problem
• On the Steiner, geodetic and hull numbers of graphs
• Steiner distance and convexity in graphs
• Faster Steiner Tree Computation in Polynomial-Space
• Fourier meets M\"{o}bius: fast subset convolution
• Generating All Maximal Independent Sets: NP-Hardness and Polynomial-Time Algorithms
• A search strategy for the elementary cycles of a directed graph
• Steiner distance in graphs
• A Faster Algorithm for the Steiner Tree Problem
• Database Programming Languages
• The steiner problem in graphs
• The Steiner number of a graph

This page was built for publication: Generating all the Steiner trees and computing Steiner intervals for a fixed number of terminals