Algorithms for induced biclique optimization problems
type: Item
instance of: scholarly article
title: Algorithms for induced biclique optimization problems
zbMATH Open document ID: 1259.05166
published in: Information Processing Letters
publication date: 2013-03-28T00:00:00Z
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 05C76
Mathematics Subject Classification ID: 05C69
Mathematics Subject Classification ID: 05C90
zbMATH DE Number: 6149208
zbMATH Keywords: graph algorithms
zbMATH Keywords: induced biclique
zbMATH Keywords: induced balanced biclique
zbMATH Keywords: polygon-circle graph
zbMATH Keywords: interval-filament graph
zbMATH Keywords: protein
zbMATH Keywords: protein-interaction
author: Fanica Gavril
MaRDI profile type: Publication
full work available at URL: j.ipl.2011.02.005
OpenAlex ID: W1985219252
cites work: Bisimplicial vertices in even-hole-free graphs
cites work: On graphs with polynomially solvable maximum-weight clique problem
cites work: Induced matchings in intersection graphs.
cites work: Triangulated neighborhoods in even-hole-free graphs
cites work: Subtree filament graphs are subtree overlap graphs
cites work: Q3140413
cites work: Algorithms for a maximum clique and a maximum independent set of a circle graph
cites work: The intersection graphs of subtrees in trees are exactly the chordal graphs
cites work: Maximum weight independent sets and cliques in intersection graphs of filaments
cites work: 3D-interval-filament graphs
cites work: Algorithms on Subtree Filament Graphs
cites work: Q4198056
cites work: Covering and coloring polygon-circle graphs
cites work: Recognition of Polygon-Circle Graphs and Graphs of Interval Filaments Is NP-Complete
cites work: The maximum edge biclique problem is NP-complete
cites work: Formal Concept Analysis
cites work: Q5387691
cites work: Efficient graph representations
cites work: Node-Deletion Problems on Bipartite Graphs
DOI: 10.1016/J.IPL.2011.02.005
description: scientific article; zbMATH DE number 6149208