Source location with rigidity and tree packing requirements
From MaRDI portal
Publication:867918
DOI10.1016/J.ORL.2005.10.005zbMATH Open1112.90043OpenAlexW2038572867MaRDI QIDQ867918FDOQ867918
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
Recommendations
Cites Work
- Title not available (Why is that?)
- Connected rigidity matroids and unique realizations of 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
- Title not available (Why is that?)
- Algorithms for graph rigidity and scene analysis
- Forests, frames, and games: Algorithms for matroid sums and applications
- On Generic Rigidity in the Plane
- Title not available (Why is that?)
- Matroid theory and its applications in electric network theory and in statics
- Matroid matching and some applications
- Theory of semidefinite programming for sensor network localization
- An algorithm for source location in directed graphs
- Edge connectivity between nodes and node-subsets
- Title not available (Why is that?)
- On the Computational Complexity of a Rigidity Problem
- Transversals of subtree hypergraphs and the source location problem in digraphs
Cited In (6)
- Slider-pinning rigidity: a Maxwell-Laman-type theorem
- The \(d\)-dimensional rigidity matroid of sparse graphs
- Augmenting the rigidity of a graph in \(\mathbb R^{2}\)
- Static and dynamic source locations in undirected networks
- Rigid and globally rigid graphs with pinned vertices
- Globally rigid augmentation of rigid 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)
