Rooted-Tree Decompositions with Matroid Constraints and the Infinitesimal Rigidity of Frameworks with Boundaries

DOI10.1137/110846944zbMath1268.05160arXiv1109.0787OpenAlexW2962695452MaRDI QIDQ5300488

Shin-ichi Tanigawa, Naoki Katoh

Publication date: 27 June 2013

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1109.0787

zbMATH Keywords

tree decompositionbar-joint frameworksrigidity of graphstree packingcount matroidsbody-bar frameworks

Mathematics Subject Classification ID

Trees (05C05) Convex programming (90C25) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Rigidity and flexibility of structures (aspects of discrete geometry) (52C25)

Related Items (13)

Reachability in arborescence packings ⋮ Packing of arborescences with matroid constraints via matroid intersection ⋮ Global Rigidity of Line Constrained Frameworks ⋮ Packing of maximal independent mixed arborescences ⋮ Point-hyperplane frameworks, slider joints, and rigidity preserving transformations ⋮ Directed graphs, decompositions, and spatial linkages ⋮ Old and new results on packing arborescences in directed hypergraphs ⋮ Graded sparse graphs and body-length-direction frameworks ⋮ Covering Intersecting Bi-set Families under Matroid Constraints ⋮ On Maximal Independent Arborescence Packing ⋮ An Improved Bound for the Rigidity of Linearly Constrained Frameworks ⋮ Polymatroid-based capacitated packing of branchings ⋮ A sufficient connectivity condition for rigidity and global rigidity of linearly constrained frameworks in \(\mathbb{R}^2\)

This page was built for publication: Rooted-Tree Decompositions with Matroid Constraints and the Infinitesimal Rigidity of Frameworks with Boundaries