Variations on a matching based clique finding procedure
Conference
·
OSTI ID:35802
We discuss a procedure based on bipartite matching for generating large cliques in an arbitrary graph G = (V, E). After generating an initial set of cliques, we take every pair of cliques in the set and use bipartite matching to find a maximum clique in the subgraph induced by the nodes of the pair. We then recursively apply this procedure to the new clique set generated. We discuss variants like using bipartite matching to find all maximum cliques in the subgraph induced by the node of a pair of cliques. Computational results are reported on the DIMACS supplied benchmarks and other test problems, as well as comparisons with 2 other heuristics.
- OSTI ID:
- 35802
- Report Number(s):
- CONF-9408161--
- Country of Publication:
- United States
- Language:
- English
Similar Records
A Multithreaded Algorithm for Network Alignment Via Approximate Matching
Finding Maximum Cliques on the D-Wave Quantum Annealer
Using Graph Edit Distance for Noisy Subgraph Matching of Semantic Property Graphs
Conference
·
Thu Nov 15 23:00:00 EST 2012
·
OSTI ID:1089096
Finding Maximum Cliques on the D-Wave Quantum Annealer
Journal Article
·
Thu May 03 00:00:00 EDT 2018
· Journal of Signal Processing Systems
·
OSTI ID:1438358
Using Graph Edit Distance for Noisy Subgraph Matching of Semantic Property Graphs
Conference
·
Sat Dec 19 23:00:00 EST 2020
·
OSTI ID:1797780