Algorithms for induced biclique optimization problems

DOI10.1016/j.ipl.2011.02.005zbMath1259.05166OpenAlexW1985219252MaRDI QIDQ1944925

Fanica Gavril

Publication date: 28 March 2013

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2011.02.005

zbMATH Keywords

proteingraph algorithmspolygon-circle graphinterval-filament graphinduced balanced bicliqueinduced bicliqueprotein-interaction

Mathematics Subject Classification ID

Applications of graph theory (05C90) Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Graph operations (line graphs, products, etc.) (05C76)

Related Items (3)

Approximation algorithms for maximum weight k-coverings of graphs by packings ⋮ Algorithms for \(\mathcal{GA}\mathrm{-}\mathcal H\) reduced graphs ⋮ Maximum weight induced multicliques and complete multipartite subgraphs in directed path overlap graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Maximum weight independent sets and cliques in intersection graphs of filaments
• Triangulated neighborhoods in even-hole-free graphs
• Bisimplicial vertices in even-hole-free graphs
• Covering and coloring polygon-circle graphs
• Efficient graph representations
• The maximum edge biclique problem is NP-complete
• Induced matchings in intersection graphs.
• Subtree filament graphs are subtree overlap graphs
• 3D-interval-filament graphs
• The intersection graphs of subtrees in trees are exactly the chordal graphs
• Recognition of Polygon-Circle Graphs and Graphs of Interval Filaments Is NP-Complete
• Algorithms on Subtree Filament Graphs
• On graphs with polynomially solvable maximum-weight clique problem
• Node-Deletion Problems on Bipartite Graphs
• Algorithms for a maximum clique and a maximum independent set of a circle graph
• Formal Concept Analysis

This page was built for publication: Algorithms for induced biclique optimization problems