Source location with rigidity and tree packing requirements

Authors:
Zsolt Fekete
Affiliations:
Department of Operations Research, Eötvös University, Pázmány Péter sétány 1/C, Budapest H-1117, Hungary
Venue:
Operations Research Letters
Year:
2006

Citing 4
Cited 2

Theory of semidefinite programming for sensor network localization

SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Connected rigidity matroids and unique realizations of graphs

Journal of Combinatorial Theory Series B
Transversals of subtree hypergraphs and the source location problem in digraphs

Networks
An algorithm for source location in directed graphs

Operations Research Letters

Combinatorial genericity and minimal rigidity

Proceedings of the twenty-fourth annual symposium on Computational geometry
On the Infinitesimal Rigidity of Bar-and-Slider Frameworks

ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider the following two problems: (i) given a graph, find a minimum size vertex-set such that the pinning of it makes the graph rigid in the plane. (ii) Given a graph, contract a minimum size vertex-set such that the resulting graph has two edge-disjoint spanning trees. We prove that these problems are polynomially solvable.