English

Extending Bron Kerbosch for Solving the Maximum Weight Clique Problem

Data Structures and Algorithms 2011-01-07 v1 Computer Vision and Pattern Recognition
Authors: Brijnesh Jain , Klaus Obermayer
View on arXiv ↗ PDF ↗

Abstract

This contribution extends the Bron Kerbosch algorithm for solving the maximum weight clique problem, where continuous-valued weights are assigned to both, vertices and edges. We applied the proposed algorithm to graph matching problems.

Keywords

graph algorithms

Cite

@article{arxiv.1101.1266,
  title  = {Extending Bron Kerbosch for Solving the Maximum Weight Clique Problem},
  author = {Brijnesh Jain and Klaus Obermayer},
  journal= {arXiv preprint arXiv:1101.1266},
  year   = {2011}
}

Related papers

View all related →
Data Structures and Algorithms · Computer Science
A Maximum Edge-Weight Clique Extraction Algorithm Based on Branch-and-Bound
Satoshi Shimizu, Kazuaki Yamaguchi, Sumio Masuda
2018-10-25
Data Structures and Algorithms · Computer Science
Improved Exact and Heuristic Algorithms for Maximum Weight Clique
Roman Erhardt, Kathrin Hanauer, Nils Kriege, Christian Schulz +1
2023-02-02
Data Structures and Algorithms · Computer Science
Using modular decomposition technique to solve the maximum clique problem
Irina Utkina
2017-10-12
Artificial Intelligence · Computer Science
A Necessary and Sufficient Condition for Graph Matching Being Equivalent to the Maximum Weight Clique Problem
Brijnesh Jain, Klaus Obermayer
2009-12-24
Data Structures and Algorithms · Computer Science
A Parallel Branch and Bound Algorithm for the Maximum Labelled Clique Problem
Ciaran McCreesh, Patrick Prosser
2014-11-18
Data Structures and Algorithms · Computer Science
The Bron-Kerbosch Algorithm with Vertex Ordering is Output-Sensitive
George Manoussakis
2024-02-13
Condensed Matter · Physics
A Novel Approach Applied to the Largest Clique Problem
Vladimir Gudkov, Shmuel Nussinov, Zohar Nussinov
2007-05-23
Social and Information Networks · Computer Science
Subnetwork Constraints for Tighter Upper Bounds and Exact Solution of the Clique Partitioning Problem
Alexander Belyi, Stanislav Sobolevsky, Alexander Kurbatski, Carlo Ratti
2023-09-15
Data Structures and Algorithms · Computer Science
Fast Algorithms for the Maximum Clique Problem on Massive Graphs with Applications to Overlapping Community Detection
Bharath Pattabiraman, Md. Mostofa Ali Patwary, Assefaw H. Gebremedhin, Wei-keng Liao +1
2014-12-01
Quantum Physics · Physics
Quantum speed-up in solving the maximal clique problem
Weng-Long Chang, Qi Yu, Zhaokai Li, Jiahui Chen +2
2018-04-18
Distributed, Parallel, and Cluster Computing · Computer Science
The Shape of the Search Tree for the Maximum Clique Problem, and the Implications for Parallel Branch and Bound
Ciaran McCreesh, Patrick Prosser
2014-09-05
Data Structures and Algorithms · Computer Science
Faster maximal clique enumeration in large real-world link streams
Alexis Baudin, Clémence Magnien, Lionel Tabourier
2024-05-27
Data Structures and Algorithms · Computer Science
On Finding All Connected Maximum-Sized Common Subgraphs in Multiple Labeled Graphs
Johannes B. S. Petersen, Akbar Davoodi, Thomas Gärtner, Marc Hellmuth +1
2025-04-03
Algebraic Geometry · Mathematics
Maximal skew sets of lines on a Hermitian surface and a modified Bron-Kerbosch algorithm
Anna Brosowsky, Haoyu Du, Madhav Krishna, Sandra Nair +2
2022-12-01
Data Structures and Algorithms · Computer Science
Algorithms for Computing Maximum Cliques in Hyperbolic Random Graphs
Eunjin Oh, Seunghyeok Oh
2023-06-30
Artificial Intelligence · Computer Science
A Short Review on Novel Approaches for Maximum Clique Problem: from Classical algorithms to Graph Neural Networks and Quantum algorithms
Raffaele Marino, Lorenzo Buffoni, Bogdan Zavalnij
2024-03-18
Data Structures and Algorithms · Computer Science
Fast Algorithms for the Maximum Clique Problem on Massive Sparse Graphs
Bharath Pattabiraman, Md. Mostofa Ali Patwary, Assefaw H. Gebremedhin, Wei-keng Liao +1
2012-11-15
Social and Information Networks · Computer Science
A Fast Maximum Clique Algorithm Based on Network Decomposition for Large Sparse Networks
Tianlong Fan, Wenjun Jiang, Yi-Cheng Zhang, Linyuan Lü
2024-04-22
Data Structures and Algorithms · Computer Science
Is it possible to find the maximum clique in general graphs?
José Ignacio Alvarez-Hamelin
2012-02-21
Data Structures and Algorithms · Computer Science
A Faster Algorithm for Maximum Weight Matching on Unrestricted Bipartite Graphs
Shawxing Kwok
2025-04-07
Data Structures and Algorithms · Computer Science
BBK: a simpler, faster algorithm for enumerating maximal bicliques in large sparse bipartite graphs
Alexis Baudin, Clémence Magnien, Lionel Tabourier
2024-05-27
Optimization and Control · Mathematics
The Maximum Clique Problem under Adversarial Uncertainty: a min-max approach
Immanuel Bomze, Chiara Faccio, Francesco Rinaldi, Giovanni Spisso
2026-01-12
Data Structures and Algorithms · Computer Science
On the Hardness of Compressing Weights
Bart M. P. Jansen, Shivesh K. Roy, Michał Włodarczyk
2021-07-07
Disordered Systems and Neural Networks · Physics
Hard Optimization Problems have Soft Edges
Raffaele Marino, Scott Kirkpatrick
2023-05-26
Data Structures and Algorithms · Computer Science
Adapting the Bron-Kerbosch Algorithm for Enumerating Maximal Cliques in Temporal Graphs
Anne-Sophie Himmel, Hendrik Molter, Rolf Niedermeier, Manuel Sorge
2017-05-03
R2 v1 2026-06-21T17:08:30.129Z