Abstract
The biclique problem asks, given a graph G and a parameter k, whether G has a complete bipartite subgraph of k vertices in each part (a biclique of order k). Fixed-parameter tractability of this problem is a longstanding open question in parameterized complexity that received a lot of attention from the community. In this paper we consider a restricted version of this problem by introducing an additional parameter s and assuming that G does not have induced (i.e. chordless) paths of length s. We prove that under this parameterization the problem becomes fixed-parameter linear. The main tool in our proof is a Ramsey-type theorem stating that a graph with a long (not necessarily induced) path contains either a long induced path or a large biclique.
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
Arbib, C., Mosca, R.: Polynomial algorithms for special cases of the balanced complete bipartite subgraph problem. J. Combin. Math. Combin. Comput. 39, 3–22 (1999)
Bascó, G., Tuza, Z.: A characterization of graphs without long induced paths. J. of Graph Theory 14, 455–464 (1990)
Binkele-Raible, D., Fernau, H., Gaspers, S., Liedloff, M.: Exact exponential-time algorithms for finding bicliques. Inf. Process. Lett. 111(2), 64–67 (2010)
Bodlaender, H.L.: On linear time minor tests with depth-first search. J. Algorithms 14(1), 1–23 (1993)
Broersma, H., Golovach, P.A., Paulusma, D., Song, J.: Updating the complexity status of coloring graphs without a fixed induced linear forest. Theor. Comput. Sci. 414(1), 9–19 (2012)
Bulatov, A.A., Marx, D.: Constraint Satisfaction Parameterized by Solution Size. In: Aceto, L., Henzinger, M., Sgall, J. (eds.) ICALP 2011, Part I. LNCS, vol. 6755, pp. 424–436. Springer, Heidelberg (2011)
Chen, Y., Thurley, M., Weyer, M.: Understanding the Complexity of Induced Subgraph Isomorphisms. In: Aceto, L., Damgård, I., Goldberg, L.A., Halldórsson, M.M., Ingólfsdóttir, A., Walukiewicz, I. (eds.) ICALP 2008, Part I. LNCS, vol. 5125, pp. 587–596. Springer, Heidelberg (2008)
Courcelle, B., Makowsky, J.A., Rotics, U.: Linear Time Solvable Optimization Problems on Graphs of Bounded Clique Width. In: Hromkovič, J., Sýkora, O. (eds.) WG 1998. LNCS, vol. 1517, pp. 1–16. Springer, Heidelberg (1998)
Demaine, E., Gutin, G.Z., Marx, D., Stege, U.: 07281 open problems – structure theory and FPT algorithmcs for graphs, digraphs and hypergraphs. In: Demaine, E., Gutin, G.Z., Marx, D., Stege, U. (eds.) Structure Theory and FPT Algorithmics for Graphs, Digraphs and Hypergraphs, Dagstuhl, Germany. Dagstuhl Seminar Proceedings, vol. (07281), Internationales Begegnungs- und Forschungszentrum für Informatik (IBFI), Schloss Dagstuhl, Germany (2007)
Diestel, R.: Graph Theory, 3rd edn. Springer (2005)
Dong, J.: Some results on graphs without long induced paths. J. of Graph Theory 22, 23–28 (1996)
Feige, U., Kogan, S.: Hardness of approximation of the balanced complete bipartite subgraph problem. Technical Report MCS04-04, Weizmann Institute of Science (2004)
Fellows, M., Gaspers, S., Rosamond, F.: Multivariate complexity theory. In: Blum, E.K., Aho, A.V. (eds.) Computer Science: The Hardware, Software and Heart of It, pp. 269–293. Springer (2011)
Fellows, M.R., Langston, M.A.: On search, decision and the efficiency of polynomial-time algorithms (extended abstract). In: STOC, pp. 501–512 (1989)
Golovach, P.A., Paulusma, D., Song, J.: Coloring Graphs without Short Cycles and Long Induced Paths. In: Owe, O., Steffen, M., Telle, J.A. (eds.) FCT 2011. LNCS, vol. 6914, pp. 193–204. Springer, Heidelberg (2011)
Johnson, D.S.: The NP-completeness column: An ongoing guide. J. Algorithms 8(3), 438–448 (1987)
Korobitsyn, D.: On the complexity of determining the domination number in monogenic classes of graphs. Diskretnaya Matematika 2(3), 90–96 (1990) (in Russian)
Král’, D., Kratochvíl, J., Tuza, Z., Woeginger, G.J.: Complexity of Coloring Graphs without Forbidden Induced Subgraphs. In: Brandstädt, A., Le, V.B. (eds.) WG 2001. LNCS, vol. 2204, pp. 254–262. Springer, Heidelberg (2001)
Kühn, D., Osthus, D.: Induced subdivisions in K\(_{\mbox{s, s}}\)-free graphs of large average degree. Combinatorica 24(2), 287–304 (2004)
Le, V.B., Randerath, B., Schiermeyer, I.: On the complexity of 4-coloring graphs without long induced paths. Theor. Comput. Sci. 389(1-2), 330–335 (2007)
Lozin, V.V., Mosca, R.: Maximum independent sets in subclasses of P\(_{\mbox{5}}\)-free graphs. Inf. Process. Lett. 109(6), 319–324 (2009)
Lozin, V.V., Rautenbach, D.: Some results on graphs without long induced paths. Inf. Process. Lett. 88(4), 167–171 (2003)
Murphy, O.J.: Computing independent sets in graphs with large girth. Discrete Applied Mathematics 35(2), 167–170 (1992)
Randerath, B., Schiermeyer, I.: 3-colorability in P for P\(_{\mbox{6}}\)-free graphs. Discrete Applied Mathematics 136(2-3), 299–313 (2004)
Woeginger, G.J., Sgall, J.: The complexity of coloring graphs without long induced paths. Acta Cybernetica 15(1), 107–117 (2001)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Atminas, A., Lozin, V.V., Razgon, I. (2012). Linear Time Algorithm for Computing a Small Biclique in Graphs without Long Induced Paths. In: Fomin, F.V., Kaski, P. (eds) Algorithm Theory – SWAT 2012. SWAT 2012. Lecture Notes in Computer Science, vol 7357. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-31155-0_13
Download citation
DOI: https://doi.org/10.1007/978-3-642-31155-0_13
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-31154-3
Online ISBN: 978-3-642-31155-0
eBook Packages: Computer ScienceComputer Science (R0)