Algorithms for weakly triangulated graphs
Discrete Applied Mathematics
Covering and coloring polygon-circle graphs
Discrete Mathematics
Maximum weight independent sets and cliques in intersection graphs of filaments
Information Processing Letters
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Partitioning chordal graphs into independent sets and cliques
Discrete Applied Mathematics - Brazilian symposium on graphs, algorithms and combinatorics
A lock-and-key model for protein--protein interactions
Bioinformatics
Discrete Applied Mathematics
The Complexity of the List Partition Problem for Graphs
SIAM Journal on Discrete Mathematics
Algorithms on Subtree Filament Graphs
Graph Theory, Computational Intelligence and Thought
Recognition of polygon-circle graphs and graphs of interval filaments is NP-complete
WG'07 Proceedings of the 33rd international conference on Graph-theoretic concepts in computer science
Modeling Protein Interacting Groups by Quasi-Bicliques: Complexity, Algorithm, and Application
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Algorithms for induced biclique optimization problems
Information Processing Letters
| Hi-index | 0.00 |
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 K2,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.