A new algorithm for the maximum-weight clique problem

Authors:
Patric R. J. Östergård
Affiliations:
Department of Electrical and Communications Engineering, Helsinki University of Technology, P.O. Box 3000, FIN-02015 HUT, Finland
Venue:
Nordic Journal of Computing
Year:
2001

Citing 6
Cited 16

Minimum weighted coloring of triangulated graphs, with application to maximum weight vertex packing and clique finding in arbitrary graphs

SIAM Journal on Computing
Sequential and parallel algorithms for the maximum-weight independent set problem on permutation graphs

Information Processing Letters
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
A fast algorithm for the maximum clique problem

Discrete Applied Mathematics - Sixth Twente Workshop on Graphs and Combinatorial Optimization
New constant weight codes from linear permutation groups

IEEE Transactions on Information Theory
Upper bounds for constant-weight codes

IEEE Transactions on Information Theory

Mining Frequent Labeled and Partially Labeled Graph Patterns

ICDE '04 Proceedings of the 20th International Conference on Data Engineering
A clique algorithm for standard quadratic programming

Discrete Applied Mathematics
Enhancing PC Cluster-Based Parallel Branch-and-Bound Algorithms for the Graph Coloring Problem

IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
A New Datapath Merging Method for Reconfigurable System

ARC '09 Proceedings of the 5th International Workshop on Reconfigurable Computing: Architectures, Tools and Applications
Real-time systems: incomplete solution approach for the maximum-weighted clique problem

AIA '08 Proceedings of the 26th IASTED International Conference on Artificial Intelligence and Applications
Improving the maximum-weight clique algorithm for the dense graphs

ICCOMP'06 Proceedings of the 10th WSEAS international conference on Computers
Optimal wafer cutting in shuttle layout problems

Journal of Combinatorial Optimization
A new approach for solving the maximum clique problem

AAIM'06 Proceedings of the Second international conference on Algorithmic Aspects in Information and Management
A modified merging approach for datapath configuration time reduction

ARC'10 Proceedings of the 6th international conference on Reconfigurable Computing: architectures, Tools and Applications
A new table of permutation codes

Designs, Codes and Cryptography
Heuristics-based query optimisation for SPARQL

Proceedings of the 15th International Conference on Extending Database Technology
An exact approach for the Vertex Coloring Problem

Discrete Optimization
Diversifying top-k results

Proceedings of the VLDB Endowment
Scheduling and channel assignment algorithm for IEEE 802.16 mesh networks using clique partitioning technique

Computer Communications
Algorithms for the extraction of synteny blocks from comparative maps

WABI'07 Proceedings of the 7th international conference on Algorithms in Bioinformatics
An OBDD approach to enforce confidentiality and visibility constraints in data publishing

Journal of Computer Security - DBSec 2011

Quantified Score

Hi-index	0.00

Visualization

Abstract

Given a graph, in the maximum clique problem one wants to find the largest number of vertices, any two of which are adjacent. In the maximum-weight clique problem, the vertices have positive, integer weights, and one wants to find a clique with maximum weight. A recent algorithm for the maximum clique problem is here used as a basis for developing an algorithm for the weighted case. Computational experiments with random graphs show that this new algorithm is faster than earlier algorithms in many cases. A set of weighted graphs obtained from the problem of constructing good constant weight error-correcting codes are proposed as test cases for maximum-weight clique algorithms; in fact, one of these leads to a new record-breaking code.