Decomposing the feasibility of clustered spanning tree by paths

DOI10.1016/J.DAM.2022.11.009MaRDI QIDQ6558681zbMATH OpenFDO

Authors Nili Guttmann-Beck, Michal Stern

Publication date 20 June 2024

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.DAM.2022.11.009

zbMATH Keywords

clustered treefeasibilityminimization

Mathematics Subject Classification ID

Trees (05C05) Paths and cycles (05C38) Hypergraphs (05C65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• Vertices removal for feasibility of clustered spanning trees
• Clustered spanning tree -- conditions for feasibility
• Achieving feasibility for clustered traveling salesman problems using PQ‐trees
• On the minimum routing cost clustered tree problem
• On the complexity of graph tree partition problems.

Cites work

• A Characterization of Soft Hypergraphs
• Blocks of hypergraphs. Applied to hypergraphs and outerplanarity
• Clustered spanning tree -- conditions for feasibility
• Degrees of acyclicity for hypergraphs and relational database schemes
• scientific article; zbMATH DE number 3641484 (Why is no real title available?)
• Hypergraph planarity and the complexity of drawing venn diagrams
• Hypergraphes arbores
• On planar supports for hypergraphs
• On the Consecutive-Retrieval Problem
• Path-based supports for hypergraphs
• Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs
• Subdivision Drawings of Hypergraphs
• Topics in Intersection Graph Theory
• Vertices removal for feasibility of clustered spanning trees

Cited in

(2)

• Achieving feasibility for clustered traveling salesman problems using PQ‐trees
• Insertion and removal lists gaining clustered subtrees

This page was built for publication: Decomposing the feasibility of clustered spanning tree by paths

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