Abstract
Let G be an edge-bicolored graph where each edge is colored either red or blue. We study problems of obtaining an induced subgraph H from G that simultaneously satisfies given properties for H’s red graph and blue graph. In particular, we consider Dually Connected Induced Subgraph problem — find from G a k-vertex induced subgraph whose red and blue graphs are both connected, and Dual Separator problem — delete at most k vertices to simultaneously disconnect red and blue graphs of G.
We will discuss various algorithmic and complexity issues for Dually Connected Induced Subgraph and Dual Separator problems: NP-completeness, polynomial-time algorithms, W[1]-hardness, and FPT algorithms. As by-products, we deduce that it is NP-complete and W[1]-hard to find k-vertex (resp., (n − k)-vertex) strongly connected induced subgraphs from n-vertex digraphs. We will also give a complete characterization of the complexity of the problem of obtaining a k-vertex induced subgraph H from G that simultaneously satisfies given hereditary properties for H’s red and blue graphs.
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
Preview
Unable to display preview. Download preview PDF.
References
Bang-Jensen, J., Gutin, G.: Alternating cycles and paths in edge-coloured multigraphs: a survey. Discrete Mathematics 165, 39–60 (1997)
Bui-Xuan, B.M., Habib, M., Paul, C.: Competitive graph searches. Theoretical Computer Science 393(1), 72–80 (2008)
Cai, L.: Fixed-parameter tractability of graph modification problems for hereditary properties. Information Processing Letters 58(4), 171–176 (1996)
Cai, L., Chan, S.M., Chan, S.O.: Random separation: A new method for solving fixed-cardinality optimization problems. In: Bodlaender, H.L., Langston, M.A. (eds.) IWPEC 2006. LNCS, vol. 4169, pp. 239–250. Springer, Heidelberg (2006)
Dehne, F., Fellows, M., Langston, M., Rosamond, F., Stevens, K.: An O(2O(k) n 3) FPT algorithm for the undirected feedback vertex set problem. Theory of Computing Systems 41(3), 479–492 (2007)
Downey, R.G., Fellows, M.R.: Parameterized Complexity. Springer, New York (1999)
Gai, A.T., Habib, M., Paul, C., Raffinot, M.: Identifying common connected components of graphs. Technical Report RR-LIRMM-03016, LIRMM, Université de Montpellier II (2003)
Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman, New York (1979)
Garey, M.R., Johnson, D.S., Stockmeyer, L.: Some simplified NP-complete graph problems. Theoretical Computer Science 1(3), 237–267 (1976)
Guo, J., Gramm, J., Hüffner, F., Niedermeier, R., Wernicke, S.: Compression-based fixed-parameter algorithms for feedback vertex set and edge bipartization. Journal of Computer and System Sciences 72, 1386–1396 (2006)
Habib, M., Paul, C.: A survey of the algorithmic aspects of modular decomposition. Computer Science Review 4(1), 41–59 (2010)
Kano, M., Li, X.: Monochromatic and heterochromatic subgraphs in edge-colored graphs-a survey. Graphs and Combinatorics 24(4), 237–263 (2008)
Khot, S., Raman, V.: Parameterized complexity of finding subgraphs with hereditary properties. Theoretical Computer Science 289(2), 997–1008 (2002)
Marx, D.: Chordal deletion is fixed-parameter tractable. Algorithmica 57(4), 747–768 (2010)
Marx, D., Schlotter, I.: Obtaining a planar graph by vertex deletion. Algorithmica 62(3-4), 807–822 (2012)
Naor, M., Schulman, L.J., Srinivasan, A.: Splitters and near-optimal derandomization. In: Proceedings of the 36th Annual Symposium of Foundations of Computer Science, pp. 182–191 (1995)
Reed, B., Smith, K., Vetta, A.: Finding odd cycle transversals. Operations Research Letters 32(4), 299–301 (2004)
Uno, T., Yagiura, M.: Fast algorithms to enumerate all common intervals of two permutations. Algorithmica 26(2), 290–309 (2000)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Cai, L., Ye, J. (2014). Dual Connectedness of Edge-Bicolored Graphs and Beyond . In: Csuhaj-Varjú, E., Dietzfelbinger, M., Ésik, Z. (eds) Mathematical Foundations of Computer Science 2014. MFCS 2014. Lecture Notes in Computer Science, vol 8635. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-44465-8_13
Download citation
DOI: https://doi.org/10.1007/978-3-662-44465-8_13
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-662-44464-1
Online ISBN: 978-3-662-44465-8
eBook Packages: Computer ScienceComputer Science (R0)