Abstract
Motivated by challenges related to domination, connectivity, and information propagation in social and other networks, we initiate the study of the Vector Connectivity problem. This problem takes as input a graph G and an integer k v for every vertex v of G, and the objective is to find a vertex subset S of minimum cardinality such that every vertex v either belongs to S, or is connected to at least k v vertices of S by disjoint paths. If we require each path to be of length exactly 1, we get the well-known Vector Domination problem, which is a generalization of the famous Dominating Set problem and several of its variants. Consequently, our problem becomes NP-hard if an upper bound on the length of the disjoint paths is also supplied as input. Due to the hardness of these domination variants even on restricted graph classes, like split graphs, Vector Connectivity seems to be a natural problem to study for drawing the boundaries of tractability for this type of problems. We show that Vector Connectivity can actually be solved in polynomial time on split graphs, in addition to cographs and trees. We also show that the problem can be approximated in polynomial time within a factor of ln n + 2 on all graphs.
This work is supported by the Research Council of Norway (197548/F20) and by the Slovenian Research Agency (research program P1–0285 and research projects J1–4010, J1–4021, BI-US/12–13–029 and N1–0011: GReGAS, supported in part by the European Science Foundation).
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Chlebík, M., Chlebíkova, J.: Approximation hardness of dominating set problems in bounded degree graphs. Information and Computation 206, 1264–1275 (2008)
Chen, N.: On the approximability of inuence in social networks. SIAM Journal on Discrete Mathematics 23, 1400–1415 (2009)
Cicalese, F., Milanič, M., Vaccaro, U.: On the approximability and exact algorithms for vector domination and related problems in graphs. Discrete Applied Mathematics (2012), doi:10.1016/j.dam.2012.10.007
Corneil, D.G., Lerchs, H., Stewart Burlingham, L.: Complement reducible graphs. Discrete Applied Mathematics 3, 163–174 (1981)
Corneil, D.G., Perl, Y., Stewart, L.K.: A linear recognition algorithm for cographs. SIAM J. Comput. 14, 926–934 (1985)
Garey, M.R., Johnson, D.S.: Computers and Intractability. W.H. Freeman and Co., New York (1979)
Golumbic, M.C.: Algorithmic Graph Theory and Perfect Graphs, 2nd edn. Annals of Discrete Mathematics, vol. 57. Elsevier (2004)
Habib, M., Paul, C.: A simple linear time algorithm for cograph recognition. Discrete Applied Mathematics 145, 183–197 (2005)
Hammer, P.L., Simeone, B.: The splittance of a graph. Combinatorica 1, 275–284 (1981)
Harant, J., Prochnewski, A., Voigt, M.: On dominating sets and independent sets of graphs. Combinatorics, Probability and Computing 8, 547–553 (1999)
Haynes, T.W., Hedetniemi, S., Slater, P.: Fundamentals of Domination in Graphs. Marcel Dekker, New York (1998)
Haynes, T.W., Hedetniemi, S., Slater, P.: Domination in Graphs: Advanced Topics. Marcel Dekker, New York (1998)
Kempe, D., Kleinberg, J., Tardos, E.: Maximizing the spread of inuence through a social network. In: Proc. 9th ACM KDD, pp. 137–146. ACM Press (2003)
Mahadev, N., Peled, U.: Threshold graphs and related topics. Annals of Discrete Mathematics 56 (1995)
Nichterlein, A., Niedermeier, R., Uhlmann, J., Weller, M.: On tractable cases of target set selection. Social Network Analysis and Mining (2012)
Schrijver, A.: Combinatorial Optimization. Polyhedra and Efficiency. Volumes A–C. Algorithms and Combinatorics, vol. 24. Springer, Berlin (2003)
Wolsey, L.A.: An analysis of the greedy algorithm for the submodular set covering problem. Combinatorica 2, 385–393 (1982)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Boros, E., Heggernes, P., van ’t Hof, P., Milanič, M. (2013). Vector Connectivity in Graphs. In: Chan, TH.H., Lau, L.C., Trevisan, L. (eds) Theory and Applications of Models of Computation. TAMC 2013. Lecture Notes in Computer Science, vol 7876. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-38236-9_30
Download citation
DOI: https://doi.org/10.1007/978-3-642-38236-9_30
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-38235-2
Online ISBN: 978-3-642-38236-9
eBook Packages: Computer ScienceComputer Science (R0)