Abstract
A graph is a multiclique if its connected components are cliques. A graph is a complete multipartite graph if it is the complement of a multiclique. A graph is a multiclique-multipartite graph if its vertex set has a partition U, W such that G(U) is complete multipartite, G(W) is a multiclique and every two vertices u(U, v(W are adjacent. We describe a polynomial time algorithm to find in polygon-circle graphs a maximum induced complete multipartite subgraph containing an induced K 2,2. In addition, we describe polynomial time algorithms to find maximum induced multicliques and multiclique-multipartite subgraphs in circle graphs. These problems have applications for clustering of proteins by PPI criteria.
Access provided by Autonomous University of Puebla. Download to read the full chapter text
Chapter PDF
Similar content being viewed by others
Keywords
References
Cameron, K., Hell, P.: Independent Packings in Structured Graphs. Math. Program. Ser. B 105, 201–213 (2006)
Cameron, K., Eschen, E.M., Hoang, C.T., Sritharan, R.: The Complexity of the List Partition Problem of Graphs. SIAM J. Discrete Math. 21, 900–929 (2007)
Even, S., Itai, A.: Queues, Stacks and Graphs. In: Kohavi, Z., Paz, A. (eds.) Theory of Machines and Computations, pp. 71–86. Academic Press, New York (1971)
Gallai, T.: Transitiv Orientirbare Graphen. Acta Math. Acad. Sci. Hungar 18, 25–26 (1967)
Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory NP-Completeness. W. H. Freeman and Co., San Francisco (1979)
Gavril, F.: Algorithms for a Maximum Clique and a Maximum Independent Set of a Circle Graph. Networks 3, 261–273 (1973)
Gavril, F.: Maximum Weight Independent Sets and Cliques in Intersection Graphs of Filaments. Inform. Proc. Lett. 73, 181–188 (2000)
Gavril, F.: 3D-Interval-Filament Gaphs. Discrete Appl. Math. 155, 2625–2636 (2007)
Gavril, F.: Algorithms on Subtree Filament Graphs. In: Lipshteyn, M., Levit, V.E., McConnell, R.M. (eds.) Graph Theory, Computational Intelligence and Thought. LNCS, vol. 5420, pp. 27–35. Springer, Heidelberg (2009)
Gavril, F.: Algorithms for Induced Biclique Optimization Problems. Inform. Proc. Lett. 111, 469–473 (2011)
Gavril, F.: Minimum Weight Feedback Vertex Sets in Circle n-Gon Graphs and Circle Trapezoid Graphs. Discrete Math., Algorithms and Applications 3, 323–336 (2011)
Golumbic, M.C., Rotem, D., Urrutia, J.: Comparability Graphs and Intersection Graphs. Discrete Math. 43, 37–46 (1983)
Hell, P., Klein, S., Nogueira, L.T., Protti, F.: Partitioning Chordal Graphs into Independent Sets and Cliques. Discrete Appl. Math. 141, 185–194 (2004)
Holm, L.: Evaluation of Different Domain-based Methods in Protein Interaction Prediction. Biochem. Biophys. Res. Commun. 390, 357–362 (2009)
Kratochvil, J., Kostochka, A.: Covering and Coloring Polygon-Circle Graphs. Discrete Math. 163, 299–305 (1997)
Liu, X., Li, J., Wang, L.: Modeling Protein Interacting Groups by Quasi-Multicliques: Complexity, Algorithm and Application. IEEE/ACM Trans. on Comp. Biology and Bioinf. 7, 354–364 (2010)
Morrison, J.L., Breitling, R., Higham, D.J., Gilbert, D.R.: A Lock-and-Key Model for Protein-Protein Interactions. Bioinformatics 22, 2012–2019 (2006)
Pergel, M.: Recognition of Polygon-Circle Graphs and Graphs of Interval Filaments Is NP-Complete. In: Brandstädt, A., Kratsch, D., Müller, H. (eds.) WG 2007. LNCS, vol. 4769, pp. 238–247. Springer, Heidelberg (2007)
Spinrad, J.P.: Efficient Graph Representations. Fields Institute Monographs. The American Mathematical Society, USA (2003)
Spinrad, J.P., Sritharan, R.: Algorithms for weakly triangulated graphs. DAM 19, 181–191 (1995)
Thomas, A., Cannings, R., Monk, N.A.M., Cannings, C.: On the Structure of Protein-Protein Interaction Networks. Biochem. Soc. Trans. 31, 1491–1496 (2003)
Yannakakis, M.: Node-Deletion Problems in Bipartite Graphs. SIAM J. Computing 10, 310–327 (1981)
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
Gavril, F. (2012). Maximum Induced Multicliques and Complete Multipartite Subgraphs in Polygon-Circle Graphs and Circle Graphs. In: Golumbic, M.C., Stern, M., Levy, A., Morgenstern, G. (eds) Graph-Theoretic Concepts in Computer Science. WG 2012. Lecture Notes in Computer Science, vol 7551. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-34611-8_30
Download citation
DOI: https://doi.org/10.1007/978-3-642-34611-8_30
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-34610-1
Online ISBN: 978-3-642-34611-8
eBook Packages: Computer ScienceComputer Science (R0)