Mixed Integer Programming for Searching Maximum Quasi-Bicliques

DOI10.1007/978-3-030-37157-9_2zbMath1442.05134arXiv2002.09880OpenAlexW3008907316MaRDI QIDQ3294898

Albina Zamaletdinova, Dmitry I. Ignatov, Polina Ivanova

Publication date: 29 June 2020

Published in: Springer Proceedings in Mathematics & Statistics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2002.09880

zbMATH Keywords

mixed integer programmingbiclusteringtriclusteringquasi-bicliquemaximal quasi-biclique

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Integer programming (90C10) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Uses Software

• Pajek
• MovieLens

Cites Work

• Unnamed Item
• Exact MIP-based approaches for finding maximum quasi-cliques and dense subgraphs
• Triadic formal concept analysis and triclustering: searching for optimal patterns
• The maximum edge biclique problem is NP-complete
• On the maximum quasi-clique problem
• Factorizing Boolean matrices using formal concepts and iterative usage of essential entries
• Near optimal solutions for maximum quasi-bicliques
• Quasi-bicliques: Complexity and Binding Pairs
• Mining a New Fault-Tolerant Pattern Type as an Alternative to Formal Concept Discovery