Source location with rigidity and tree packing requirements

DOI10.1016/J.ORL.2005.10.005MaRDI QIDQ867918zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• Packing of rigid spanning subgraphs and spanning trees
• Globally rigid augmentation of rigid graphs
• Rigid and globally rigid graphs with pinned vertices
• Spanning Rigid Subgraph Packing and Sparse Subgraph Covering
• On characterizations of rigid graphs in the plane using spanning trees

Cites work

• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 501471 (Why is no real title available?)
• scientific article; zbMATH DE number 2152473 (Why is no real title available?)
• scientific article; zbMATH DE number 952952 (Why is no real title available?)
• Algorithms for graph rigidity and scene analysis
• An algorithm for source location in directed graphs
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• Connected rigidity matroids and unique realizations of graphs
• Edge connectivity between nodes and node-subsets
• Edge-Disjoint Spanning Trees of Finite Graphs
• Forests, frames, and games: Algorithms for matroid sums and applications
• Matroid matching and some applications
• Matroid theory and its applications in electric network theory and in statics
• On Generic Rigidity in the Plane
• On graphs and rigidity of plane skeletal structures
• On the Computational Complexity of a Rigidity Problem
• On the Problem of Decomposing a Graph into n Connected Factors
• Theory of semidefinite programming for sensor network localization
• Transversals of subtree hypergraphs and the source location problem in digraphs

Cited in

(6)

• Globally rigid augmentation of rigid graphs
• Augmenting the rigidity of a graph in \(\mathbb R^{2}\)
• Rigid and globally rigid graphs with pinned vertices
• Slider-pinning rigidity: a Maxwell-Laman-type theorem
• Static and dynamic source locations in undirected networks
• The \(d\)-dimensional rigidity matroid of sparse graphs

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

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