Maximum induced multicliques and complete multipartite subgraphs in polygon-circle graphs and circle graphs

DOI10.1007/978-3-642-34611-8_30zbMATH Open1341.05188OpenAlexW32909916MaRDI QIDQ5200516FDOQ5200516

Authors: Fanica Gavril 

Publication date: 6 November 2012

Published in: Graph-Theoretic Concepts in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-34611-8_30

Recommendations

• Maximum weight induced multicliques and complete multipartite subgraphs in directed path overlap graphs
• Algorithms for induced biclique optimization problems
• New clique and independent set algorithms for circle graphs
• On finding and enumerating maximal and maximum \( k\)-partite cliques in \( k\)-partite graphs
• scientific article; zbMATH DE number 5863491

zbMATH Keywords

polygon-circle graphcircle graphinduced complete multipartite subgraphinduced multicliqueprotein-protein-interaction

Mathematics Subject Classification ID

Applications of graph theory (05C90) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Genetics and population dynamics (92D99)

Cited In (3)

• Algorithms for finding an independent \(\{K_1,K_2\}\)-packing of maximum weight in a graph
• Maximum weight induced multicliques and complete multipartite subgraphs in directed path overlap graphs
• Algorithms for induced biclique optimization problems

This page was built for publication: Maximum induced multicliques and complete multipartite subgraphs in polygon-circle graphs and circle graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5200516)