How to Make a Square Grid Framework with Cables Rigid
From MaRDI portal
Publication:4507368
DOI10.1137/S0097539798347189zbMath0964.05066MaRDI QIDQ4507368
Publication date: 18 October 2000
Published in: SIAM Journal on Computing (Search for Journal in Brave)
graph algorithmlinear timemin-max theoremconnectivity augmentationstrongly connectedrigid frameworksquare grid
Minimax problems in mathematical programming (90C47) Combinatorial optimization (90C27) Graph algorithms (graph-theoretic aspects) (05C85) Rigidity and flexibility of structures (aspects of discrete geometry) (52C25) Connectivity (05C40)
Related Items (3)
Graph connectivity and its augmentation: Applications of MA orderings ⋮ Algorithms for (0, 1,d)-graphs withdconstrains ⋮ Bipartition constrained edge-splitting in directed graphs
This page was built for publication: How to Make a Square Grid Framework with Cables Rigid