Abstract
Seidel’s switching is a graph operation which makes a given vertex adjacent to precisely those vertices to which it was non-adjacent before, while keeping the rest of the graph unchanged. Two graphs are called switching-equivalent if one can be made isomorphic to the other one by a sequence of switches.
Jelínková et al. [DMTCS 13, no. 2, 2011] presented a proof that it is NP-complete to decide if the input graph can be switched to contain at most a given number of edges. There turns out to be a flaw in their proof. We present a correct proof.
Furthermore, we prove that the problem remains NP-complete even when restricted to graphs whose density is bounded from above by an arbitrary fixed constant. This partially answers a question of Matoušek and Wagner [Discrete Comput. Geom. 52, no. 1, 2014].
V. Jelínek and J. Kratochvíl—Supported by CE-ITI project GACR P202/12/G061.
E. Jelínková—Supported by the grant SVV-2016-260332.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Bui, T.N., Chaudhuri, S., Leighton, F.T., Sipser, M.: Graph bisection algorithms with good average case behavior. Combinatorica 7(2), 171–191 (1987)
Ehrenfeucht, A., Hage, J., Harju, T., Rozenberg, G.: Complexity issues in switching of graphs. In: Ehrig, H., Engels, G., Kreowski, H.-J., Rozenberg, G. (eds.) TAGT 1998. LNCS, vol. 1764, pp. 59–70. Springer, Heidelberg (2000)
Garey, M.R., Johnson, D.S., Stockmeyer, L.: Some simplified NP-complete graph problems. Theor. Comput. Sci. 1(3), 237–267 (1976)
Hage, J.: Structural Aspects of Switching Classes. Ph.D. thesis, Leiden Institute of Advanced Computer Science (2001)
Jelínková, E., Kratochvíl, J.: On switching to H-free graphs. J. Graph Theor. 75(4), 387–405 (2014)
Jelínková, E., Suchý, O., Hliněný, P., Kratochvíl, J.: Parameterized problems related to Seidel’s switching. Discrete Math. Theor. Comput. Sci. 13(2), 19–42 (2011)
Kozerenko, S.: On graphs with maximum size in their switching classes. Comment. Math. Univ. Carol. 56(1), 51–61 (2015)
Kratochvíl, J.: Complexity of hypergraph coloring and Seidel’s switching. In: Bodlaender, H.L. (ed.) WG 2003. LNCS, vol. 2880, pp. 297–308. Springer, Heidelberg (2003)
Lindzey, N.: Speeding up graph algorithms via switching classes. In: Kratochvíl, J., Miller, M., Froncek, D. (eds.) IWOCA 2014. LNCS, vol. 8986, pp. 238–249. Springer, Heidelberg (2015)
Matoušek, J., Wagner, U.: On Gromov’s method of selecting heavily covered points. Discrete Comput. Geom. 52(1), 1–33 (2014)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer International Publishing Switzerland
About this paper
Cite this paper
Jelínek, V., Jelínková, E., Kratochvíl, J. (2016). On the Hardness of Switching to a Small Number of Edges. In: Dinh, T., Thai, M. (eds) Computing and Combinatorics . COCOON 2016. Lecture Notes in Computer Science(), vol 9797. Springer, Cham. https://doi.org/10.1007/978-3-319-42634-1_13
Download citation
DOI: https://doi.org/10.1007/978-3-319-42634-1_13
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-42633-4
Online ISBN: 978-3-319-42634-1
eBook Packages: Computer ScienceComputer Science (R0)