Homogeneously orderable graphs and the Steiner tree problem

DOI10.1007/3-540-60618-1_90MaRDI QIDQ6122239zbMATH OpenOpenAlexFDO

Authors Andreas Brandstädt, Feodor F. Dragan, Falk Nicolai

Publication date 28 February 2024

Published in Graph-Theoretic Concepts in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-60618-1_90

Mathematics Subject Classification ID

Trees (05C05) Structural characterization of families of graphs (05C75) Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• Homogeneously orderable graphs
• Collective Additive Tree Spanners of Homogeneously Orderable Graphs
• Distance-Hereditary Graphs, Steiner Trees, and Connected Domination
• Doubly chordal graphs, steiner trees, and connected domination
• Steiner trees, connected domination and strongly chordal graphs

Cites work

• A CHARACTERIZATION OF DISTANCE-HEREDITARY GRAPHS
• Completely separable graphs
• Distance-Hereditary Graphs, Steiner Trees, and Connected Domination
• scientific article; zbMATH DE number 3641484 (Why is no real title available?)
• Hypergraphes arbores

This page was built for publication: Homogeneously orderable graphs and the Steiner tree problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6122239)