Skip to main content

Sparse Graphs and an Augmentation Problem

  • Conference paper
  • First Online:
Integer Programming and Combinatorial Optimization (IPCO 2020)

Abstract

For two integers \(k>0\) and \(\ell \), a graph \(G=(V,E)\) is called \((k,\ell )\)-tight if \(|E|=k|V|-\ell \) and \(|E(X)|\le k|X|-\ell \) for all \(X\subseteq V\) for which \(k|X|-\ell \ge 0\). G is called \((k,\ell )\)-redundant if \(G-e\) has a spanning \((k,\ell )\)-tight subgraph for all \(e\in E\). We consider the following augmentation problem. Given a graph \(G=(V,E)\) that has a \((k,\ell )\)-tight spanning subgraph, find a graph \(H=(V,F)\) with minimum number of edges, such that \(G+H\) is \((k,\ell )\)-redundant.

In this paper, we give a polynomial algorithm and a min-max theorem for this augmentation problem when the input is \((k,\ell )\)-tight. For general inputs, we give a polynomial algorithm when \(k\ge \ell \) and show the NP-hardness of the problem when \(k<\ell \). Since \((k,\ell )\)-tight graphs play an important role in rigidity theory, these algorithms can be used to make several types of rigid frameworks redundantly rigid by adding a smallest set of new bars.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Similar content being viewed by others

References

  1. Aspnes, J., et al.: A theory of network localization. IEEE Trans. Mob. Comput. 5(12), 1663–1678 (2006)

    Article  Google Scholar 

  2. Berg, A.R., Jordán, T.: Algorithms for graph rigidity and scene analysis. In: Di Battista, G., Zwick, U. (eds.) ESA 2003. LNCS, vol. 2832, pp. 78–89. Springer, Heidelberg (2003). https://doi.org/10.1007/978-3-540-39658-1_10

    Chapter  Google Scholar 

  3. Connelly, R., Jordán, T., Whiteley, W.: Generic global rigidity of body-bar frameworks. J. Comb. Theory Ser. B 103(6), 689–705 (2013)

    Article  MathSciNet  Google Scholar 

  4. Eswaran, K.P., Tarjan, R.E.: Augmentation problems. SIAM J. Comput. 5(4), 653–665 (1976)

    Article  MathSciNet  Google Scholar 

  5. Frank, A.: Connections in Combinatorial Optimization. Oxford University Press, Oxford (2011)

    MATH  Google Scholar 

  6. Frank, A., Király, T.: Combined connectivity augmentation and orientation problems. Discrete Appl. Math. 131(2), 401–419 (2003)

    Article  MathSciNet  Google Scholar 

  7. García, A., Tejel, J.: Augmenting the rigidity of a graph in \({\mathbb{R}}^{{2}}\). Algorithmica 59(2), 145–168 (2011)

    Article  MathSciNet  Google Scholar 

  8. Hendrickson, B.: Conditions for unique graph realizations. SIAM J. Comput. 21(1), 65–84 (1992)

    Article  MathSciNet  Google Scholar 

  9. Jackson, B., Jordán, T.: Brick partitions of graphs. Discrete Math. 310(2), 270–275 (2010)

    Article  MathSciNet  Google Scholar 

  10. Jackson, B., Nixon, A.: Global rigidity of generic frameworks on the cylinder. J. Comb. Theory Ser. B 139, 193–229 (2019)

    Article  MathSciNet  Google Scholar 

  11. Jacobs, D.J., Hendrickson, B.: An algorithm for two dimensional rigidity percolation: the pebble game. J. Comput. Phys. 137, 346–365 (1997)

    Article  MathSciNet  Google Scholar 

  12. Jacobs, D.J., Thorpe, M.F.: Generic rigidity percolation: the pebble game. Phys. Rev. Lett. 75, 4051–4054 (1995)

    Article  Google Scholar 

  13. Jordán, T.: Combinatorial rigidity: graphs and matroids in the theory of rigid frameworks. Discrete Geometric Analysis. vol. 34 of MSJ Memoirs, pp. 33–112. Mathematical Society of Japan, Japan (2016)

    Google Scholar 

  14. Jordán, T., Király, Cs., Tanigawa, S.: Generic global rigidity of body-hinge frameworks. J. Comb. Theory Ser. B 117, 59–76 (2016)

    Google Scholar 

  15. Király, Cs.: An efficient algorithm for testing \((k,\ell )\)-sparsity when \(\ell <0\). Technical Report (Quick Proof) QP-2019-04, Egerváry Research Group, Budapest (2019). www.cs.elte.hu/egres

  16. Király, Cs., Mihálykó, A.: Sparse graphs and an augmentation problem. Technical Report TR-2019-14, Egerváry Research Group, Budapest (2019). www.cs.elte.hu/egres

  17. Laman, G.: On graphs and rigidity of plane skeletal structures. J. Eng. Math. 4, 331–340 (1970)

    Article  MathSciNet  Google Scholar 

  18. Lee, A., Streinu, I.: Pebble game algorithms and sparse graphs. Discrete Math. 308(8), 1425–37 (2008)

    Article  MathSciNet  Google Scholar 

  19. Lorea, M.: On matroidal families. Discrete Math. 28(1), 103–106 (1979)

    Article  MathSciNet  Google Scholar 

  20. Lund, C., Yannakakis, M.: On the hardness of approximating minimization problems. J. ACM 41(5), 960–981 (1994)

    Article  MathSciNet  Google Scholar 

  21. Nash-Williams, C.S.J.A.: Decomposition of finite graphs into forests. J. Lond. Math. Soc. 39, 12 (1961)

    MathSciNet  MATH  Google Scholar 

  22. Nixon, A., Owen, J.C., Power, S.C.: Rigidity of frameworks supported on surfaces. SIAM J. Discrete Math. 26(4), 1733–1757 (2012)

    Article  MathSciNet  Google Scholar 

  23. Pollaczek-Geiringer, H.: Über die Gliederung ebener Fachwerke. ZAMM - J. Appl. Math. Mech. / Zeitschrift für Angewandte Mathematik und Mechanik 7(1), 58–72 (1927)

    Article  Google Scholar 

  24. Tay, T.-S.: Linking \((n-2)\)-dimensional panels in \(n\)-space II: \(({n} - 2, 2)\)-frameworks and body and hinge structures. Graphs Comb. 5(1), 245–73 (1989)

    Article  MathSciNet  Google Scholar 

  25. Tay, T.-S.: Henneberg’s method for bar and body frameworks. Struct. Topol. 17, 53–8 (1991)

    MATH  Google Scholar 

  26. Whiteley, W.: The union of matroids and the rigidity of frameworks. SIAM J. Discrete Math. 1(2), 237–55 (1988)

    Article  MathSciNet  Google Scholar 

  27. Whiteley, W.: Some matroids from discrete applied geometry. In: Bonin, J.E., Oxley, J.G., Servatius, B. (eds.) Matroid Theory of Contemporary Mathematics, vol. 197, pp. 171–311. AMS (1996)

    Google Scholar 

  28. Whiteley, W.: Rigidity of molecular structures: generic and geometric analysis. In: Thorpe, M.F., Duxbury, P.M. (eds.) Rigidity Theory and Applications, pp. 21–46. Springer, Boston (2002). https://doi.org/10.1007/0-306-47089-6_2

    Chapter  Google Scholar 

  29. Yu, C., Anderson, B.D.O.: Development of redundant rigidity theory for formation control. Int. J. Robust Nonlinear Control 19(13), 1427–1446 (2009)

    Article  MathSciNet  Google Scholar 

Download references

Acknowledgements

Project no. NKFI-128673 has been implemented with the support provided from the National Research, Development and Innovation Fund of Hungary, financed under the FK_18 funding scheme. The first author was supported by the János Bolyai Research Scholarship of the Hungarian Academy of Sciences and by the ÚNKP-19-4 New National Excellence Program of the Ministry for Innovation and Technology. The authors are grateful to Tibor Jordán for the inspiring discussions and his comments.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Csaba Király .

Editor information

Editors and Affiliations

Appendices

Appendix A: Sketch of the Proof of Lemma 7

Here we give the main steps of the proof of Lemma 7. Recall that we assume (A) and \(\mathcal {C}\) is the family of all \({(m,\ell )}\)-MCT sets of G. When \(\ell \le 0\), the proof is straightforward from Lemmas 1 and 6. In the case of \(\ell >0\), we need to use our assumptions (A1), (A2), and (A3) at some points. Our first statement follows by Lemma 1.

Lemma 13

If X and Y are two \({(m,\ell )}\)-MCT sets in G, such that \(X \cap Y \ne \emptyset \), then \({m}(V-(X \cup Y)) <\ell \). In particular, \(|X \cup Y| \ge |V|-1\).

If \(X\cup Y =V\) holds whenever X and Y are intersecting MCT sets, then the proof is straightforward. Hence we may assume that \(|X\cup Y| = |V|-1\) for some \(X,Y \subset V\). For a vertex \(v\in V\), let \(\varvec{\mathcal {C}(v)\,}:=\{C\in \mathcal {C}:v\notin C\}\). The first key of the proof is the following lemma which can be proved by Lemmas 6 and 13. Assumption (A1) is used in its proof.

Lemma 14

Suppose that \(\ell >0\). Assume that there exists two \({(m,\ell )}\)-MCT sets \(X,Y\in \mathcal {C}\) such that \(X\cap Y\ne \emptyset \) and \(X\cup Y=V-v\) for some \(v\in V\). Then \(\mathcal {C}(v)\) is a co-partition of \(V-v\) with \(|\mathcal {C}(v)|\ge 3\) or there exists a vertex \(u\in V-v\) such that \(T(uv)=G\).

For a vertex \(v\in V\) and a set \(W\subseteq V-v\), let \(\varvec{\widetilde{W}^v\,}:={V-v-W}\). Lemma 6 implies that, if we take two members \(W_1\) and \(W_2\) of the co-partition \(\mathcal {C}(v)\) and take \(w_1\in \widetilde{W}_1^v\) and \(w_2 \in \widetilde{W}_2^v\), then V is the only \({(m,\ell )}\)-tight set in G which contains \(w_1,w_2\) and v. Using this observation we can prove a much stronger statement which claims that in many cases \(V(w_1w_2)\) is also V.

Lemma 15

Suppose that \(\ell >0\). Let \(v\in V\) be a vertex for which the family \(\mathcal {C}(v)\) is a co-partition of \(V-v\) with \(|\mathcal {C}(v)|\ge 3\). Suppose that there exists a vertex \(u\in V-v\) with \(m(u)\le m(v)\). Let \(W_1,W_2\in \mathcal {C}(v)\) and let \(w_1\in \widetilde{W}^v_1\) and \(w_2 \in \widetilde{W}^v_2\). Suppose that \(V'\) is an \({(m,\ell )}\)-tight set in G with \(w_1,w_2 \in V'\). Then either \(V'=V\) or \(V'=\{w_1,w_2\}\). In particular, either \(V(w_1w_2)=V\) (and \(T(w_1w_2)=G\)) or \(V(w_1w_2)=\{w_1,w_2\}\).

Based on Lemma 15, using assumption (A2) one can prove the following.

Lemma 16

Suppose that \(\ell >0\). Let \(v\in V\) be a vertex for which the family \(\mathcal {C}(v)\) is a co-partition of \(V-v\) with \(|\mathcal {C}(v)|\ge 3\). Then \(m(v)< m(u)\) holds for every \(u\in V-v\) or there exist two vertices \(x,y\in V-v\) such that \(T(xy)=G\).

Finally, to finish the proof of Lemma 7, we can assume by Lemma 16 that, whenever X and Y are intersecting MCT sets with \(X\cup Y=V-v\) for a \(v \in V\), then \(m(v)< m(u)\) holds for every \(u\in V-v\). In this case, one can prove that \(\{v\}\) is an MCT set and hence \(d(v)=m(v)\). Now the proof follows from (A0), (A3) and the fact that the degree of v in any \({(m,\ell )}\)-tight subgraph on more than 3 vertices is at least m(v).

Appendix B: The algorithm of Lemma 12

In this section we give the algorithm of Lemma 12. First we solve the case when we have an MCT set consisting of a single vertex.

Lemma 17

Assume (A). If we are given an \({(m,\ell )}\)-MCT singleton set \(C=\{v\}\), then we can check if there exists an edge e such that \(T(e)=G\) in \(O(|V|^2)\) time.

Based on the steps of the proof of Lemma 7 in Appendix A we can provide the following algorithm for Lemma 12.

Algorithm 4

figure d

Proof Sketch of the Correctness of Algorithm 4: By Lemma 17 and by the correctness of Algorithm 1, we can see that any output from Steps \(2-9\) is correct. It is also clear by Algorithm 1 that the sets Z, C and S are MCT sets, thus the output in Step 10 is also correct by Lemma 7. Hence we only need to see that Step 11 gives a suitable edge. By Lemma 14, if no suitable edge is given, then \(\mathcal {C}(v)\), \(\mathcal {C}(z)\) and \(\mathcal {C}(c)\) are co-partitions. However, this contradicts Lemma 15.   \(\square \)

Rights and permissions

Reprints and permissions

Copyright information

© 2020 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Király, C., Mihálykó, A. (2020). Sparse Graphs and an Augmentation Problem. In: Bienstock, D., Zambelli, G. (eds) Integer Programming and Combinatorial Optimization. IPCO 2020. Lecture Notes in Computer Science(), vol 12125. Springer, Cham. https://doi.org/10.1007/978-3-030-45771-6_19

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-45771-6_19

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-45770-9

  • Online ISBN: 978-3-030-45771-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics