How to make a square grid framework with cables rigid

Harold N. Gabow, T. Jordán

Research output: Chapter in Book/Report/Conference proceedingConference contribution

5 Citations (Scopus)

Abstract

This paper solves the problem of making a bipartite digraph strongly connected by adding the smallest number of new edges that preserve bipartiteness. A result of Baglivo and Graver shows this corresponds to making a 2-dimensional square grid framework with cables rigid by adding the smallest number of new cables. We prove a min-max formula for the smallest number of new edges in the digraph problem, and give a corresponding linear-time algorithm. We generalize these results to the problem of making an arbitrary digraph strongly connected by adding the smallest number of new edges, each of which joins vertices in distinct blocks of a given partition of the vertex set.

Original languageEnglish
Title of host publicationProceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms
Editors Anon
PublisherSIAM
Pages356-365
Number of pages10
Publication statusPublished - 1999
EventProceedings of the 1999 10th Annual ACM-SIAM Symposium on Discrete Algorithms - Baltimore, MD, USA
Duration: Jan 17 1999Jan 19 1999

Other

OtherProceedings of the 1999 10th Annual ACM-SIAM Symposium on Discrete Algorithms
CityBaltimore, MD, USA
Period1/17/991/19/99

Fingerprint

Cable
Cables
Digraph
Grid
Linear-time Algorithm
Min-max
Join
Partition
Distinct
Generalise
Framework
Arbitrary
Vertex of a graph

ASJC Scopus subject areas

  • Chemical Health and Safety
  • Software
  • Safety, Risk, Reliability and Quality
  • Discrete Mathematics and Combinatorics

Cite this

Gabow, H. N., & Jordán, T. (1999). How to make a square grid framework with cables rigid. In Anon (Ed.), Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms (pp. 356-365). SIAM.

How to make a square grid framework with cables rigid. / Gabow, Harold N.; Jordán, T.

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms. ed. / Anon. SIAM, 1999. p. 356-365.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Gabow, HN & Jordán, T 1999, How to make a square grid framework with cables rigid. in Anon (ed.), Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms. SIAM, pp. 356-365, Proceedings of the 1999 10th Annual ACM-SIAM Symposium on Discrete Algorithms, Baltimore, MD, USA, 1/17/99.
Gabow HN, Jordán T. How to make a square grid framework with cables rigid. In Anon, editor, Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms. SIAM. 1999. p. 356-365
Gabow, Harold N. ; Jordán, T. / How to make a square grid framework with cables rigid. Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms. editor / Anon. SIAM, 1999. pp. 356-365
@inproceedings{9c837ef5836e4a19a8f6238ea4f71f3f,
title = "How to make a square grid framework with cables rigid",
abstract = "This paper solves the problem of making a bipartite digraph strongly connected by adding the smallest number of new edges that preserve bipartiteness. A result of Baglivo and Graver shows this corresponds to making a 2-dimensional square grid framework with cables rigid by adding the smallest number of new cables. We prove a min-max formula for the smallest number of new edges in the digraph problem, and give a corresponding linear-time algorithm. We generalize these results to the problem of making an arbitrary digraph strongly connected by adding the smallest number of new edges, each of which joins vertices in distinct blocks of a given partition of the vertex set.",
author = "Gabow, {Harold N.} and T. Jord{\'a}n",
year = "1999",
language = "English",
pages = "356--365",
editor = "Anon",
booktitle = "Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms",
publisher = "SIAM",

}

TY - GEN

T1 - How to make a square grid framework with cables rigid

AU - Gabow, Harold N.

AU - Jordán, T.

PY - 1999

Y1 - 1999

N2 - This paper solves the problem of making a bipartite digraph strongly connected by adding the smallest number of new edges that preserve bipartiteness. A result of Baglivo and Graver shows this corresponds to making a 2-dimensional square grid framework with cables rigid by adding the smallest number of new cables. We prove a min-max formula for the smallest number of new edges in the digraph problem, and give a corresponding linear-time algorithm. We generalize these results to the problem of making an arbitrary digraph strongly connected by adding the smallest number of new edges, each of which joins vertices in distinct blocks of a given partition of the vertex set.

AB - This paper solves the problem of making a bipartite digraph strongly connected by adding the smallest number of new edges that preserve bipartiteness. A result of Baglivo and Graver shows this corresponds to making a 2-dimensional square grid framework with cables rigid by adding the smallest number of new cables. We prove a min-max formula for the smallest number of new edges in the digraph problem, and give a corresponding linear-time algorithm. We generalize these results to the problem of making an arbitrary digraph strongly connected by adding the smallest number of new edges, each of which joins vertices in distinct blocks of a given partition of the vertex set.

UR - http://www.scopus.com/inward/record.url?scp=0032785087&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0032785087&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:0032785087

SP - 356

EP - 365

BT - Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

A2 - Anon, null

PB - SIAM

ER -