Source location with rigidity and tree packing requirements

DOI10.1016/J.ORL.2005.10.005zbMath1112.90043OpenAlexW2038572867MaRDI QIDQ867918

Zsolt Fekete

Publication date: 19 February 2007

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.orl.2005.10.005

zbMATH Keywords

spanning treesrigidity of frameworkssource locationpinning down

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Discrete location and assignment (90B80)

Related Items (5)

Globally Rigid Augmentation of Rigid Graphs ⋮ Slider-pinning rigidity: a Maxwell-Laman-type theorem ⋮ Static and dynamic source locations in undirected networks ⋮ Augmenting the rigidity of a graph in \(\mathbb R^{2}\) ⋮ The \(d\)-dimensional rigidity matroid of sparse graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Matroid matching and some applications
• Forests, frames, and games: Algorithms for matroid sums and applications
• Matroid theory and its applications in electric network theory and in statics
• Connected rigidity matroids and unique realizations of graphs
• An algorithm for source location in directed graphs
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• On graphs and rigidity of plane skeletal structures
• On the Problem of Decomposing a Graph into n Connected Factors
• Edge-Disjoint Spanning Trees of Finite Graphs
• On the Computational Complexity of a Rigidity Problem
• On Generic Rigidity in the Plane
• Edge connectivity between nodes and node-subsets
• Transversals of subtree hypergraphs and the source location problem in digraphs
• Algorithms - ESA 2003

This page was built for publication: Source location with rigidity and tree packing requirements