Decomposing the feasibility of clustered spanning tree by paths

DOI10.1016/J.DAM.2022.11.009zbMATH Open1541.05137MaRDI QIDQ6558681

Nili Guttmann-Beck, Michal Stern

Publication date: 20 June 2024

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

zbMATH Keywords

minimizationfeasibilityclustered tree

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Path-based supports for hypergraphs
• Hypergraphes arbores
• Vertices removal for feasibility of clustered spanning trees
• Blocks of Hypergraphs
• Degrees of acyclicity for hypergraphs and relational database schemes
• Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs
• Subdivision Drawings of Hypergraphs
• Hypergraph planarity and the complexity of drawing venn diagrams
• A Characterization of Soft Hypergraphs
• Topics in Intersection Graph Theory
• On the Consecutive-Retrieval Problem
• On Planar Supports for Hypergraphs

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)