Maximum weight induced multicliques and complete multipartite subgraphs in directed path overlap graphs

DOI10.1142/S1793830915500615zbMath1331.05206OpenAlexW2272968541MaRDI QIDQ2788740

Fanica Gavril

Publication date: 22 February 2016

Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s1793830915500615

zbMATH Keywords

circle graphdirected path overlap graphinduced complete multipartite subgraphinduced multiclique

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)

Cites Work

• Unnamed Item
• Maximum weight independent sets and cliques in intersection graphs of filaments
• Comparability graphs and intersection graphs
• An efficient algorithm for finding a maximum weight 2-independent set on interval graphs
• Covering and coloring polygon-circle graphs
• Partitioning chordal graphs into independent sets and cliques
• Algorithms for weakly triangulated graphs
• Algorithms for induced biclique optimization problems
• Subtree filament graphs are subtree overlap graphs
• 3D-interval-filament graphs
• Independent packings in structured graphs
• ALGORITHMS ON SUBGRAPH OVERLAP GRAPHS
• The Complexity of the List Partition Problem for Graphs
• Algorithms on Subtree Filament Graphs
• Node-Deletion Problems on Bipartite Graphs
• Weakly Triangulated Comparability Graphs
• Maximum Induced Multicliques and Complete Multipartite Subgraphs in Polygon-Circle Graphs and Circle Graphs
• Transitiv orientierbare Graphen
• Algorithms for a maximum clique and a maximum independent set of a circle graph

This page was built for publication: Maximum weight induced multicliques and complete multipartite subgraphs in directed path overlap graphs