Distributed algorithms for maximum cliques

DOI10.1080/02522667.1996.10699304MaRDI QIDQ4338575zbMATH OpenOpenAlexFDO

Authors David H. C. Du, Andrew Lim, Ching-Ting Wu

Publication date 28 May 1997

Published in Journal of Information and Optimization Sciences (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/02522667.1996.10699304

zbMATH Keywords

VLSI design

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Hardware implementations of nonnumerical algorithms (VLSI algorithms, etc.) (68W35)

Recommendations

• An algorithm for finding a maximum clique in a graph
• The maximum clique problem
• An improved branch and bound algorithm for the maximum clique problem
• Efficient Algorithms for Finding Maximum and Maximal Cliques and Their Applications
• scientific article; zbMATH DE number 1424314

Cites work

• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• A Linear Algorithm for Colouring Planar Graphs with Five Colours
• A linear algorithm for computing the optimum university timetable
• A parallel algorithm for finding a maximum clique of a set of circular arcs of a circle
• A parllel algorithm for finding a maximum weight clique of an interval graph
• Algorithms for Edge Coloring Bipartite Graphs and Multigraphs
• An 0(n log n\(+m\,\log \,\log \,n)\) maximum weight clique algorithm for circular-arc graphs
• An exact algorithm for the maximum clique problem
• Efficient parallel algorithms for finding maximal cliques, clique trees, and minimum coloring on chordal graphs
• Fast Parallel Algorithms for Chordal Graphs
• Finding a Maximum Clique in an Arbitrary Graph
• Generation of symbolic layout in one-dimensional logic array
• Improving the performance guarantee for approximate graph coloring
• Optimal parallel algorithms on circular-arc graphs
• Parallel algorithms on circular-arc graphs
• The Complexity of Near-Optimal Graph Coloring
• The Fixed Job Schedule Problem with Working-Time Constraints
• The Indirect Binary n-Cube Microprocessor Array
• The chromatic reduction problem

Cited in

(7)

• Finding Maximum Clique in Stochastic Graphs Using Distributed Learning Automata
• Distributed Approximation Algorithm for Resource Clustering
• Distributed maximum maintenance on hierarchically divided graphs
• Parallel Algorithm for Enumerating Maximal Cliques in Complex Network
• A note on improved results for one round distributed clique listing
• Maximum dispersion and geometric maximum weight cliques
• Distributed discovery of large near-cliques

This page was built for publication: Distributed algorithms for maximum cliques

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4338575)