swMATH25808MaRDI QIDQ37543FDOQ37543
Author name not available (Why is that?)
Official website: https://dl.acm.org/citation.cfm?id=362367
Cited In (only showing first 100 items - show all)
- Cliques of a graph-variations on the Bron-Kerbosch algorithm
- Lower bounds on paraclique density
- The maximum clique problem
- TOHM
- Efficient Gaussian graphical model determination under \(G\)-Wishart prior distributions
- Algorithms for detecting optimal hereditary structures in graphs, with application to clique relaxations
- The minimal \(k\)-core problem for modeling \(k\)-assemblies
- Integer programming techniques for the nurse rostering problem
- An exact bit-parallel algorithm for the maximum clique problem
- Computing Banzhaf-Coleman and Shapley-Shubik power indices with incompatible players
- CPU Benchmarks
- Graclus
- A note on the problem of reporting maximal cliques
- A graph-theoretic method for organizing overlapping clusters into trees, multiple trees, or extended trees
- Finding all solutions of affine generalized Nash equilibrium problems with one-dimensional strategy sets
- Lagrangean relaxation with clusters and column generation for the manufacturer's pallet loading problem
- A branch and bound algorithm for the maximum clique problem
- Indeterminate strings, prefix arrays \& undirected graphs
- Enumeration of Nash equilibria for two-player games
- Border bases for lattice ideals
- A computational study of conflict graphs and aggressive cut separation in integer programming
- A robust optimisation model and cutting planes for the planning of energy-efficient wireless networks
- An exact algorithm for the maximum clique problem
- QUALEX
- Cliquer
- Stony Brook
- AFGen
- OPT4J
- Gambit
- HUGIN
- BHOSLIB
- DIMACS
- MaxCliqueDyn
- CPGraph
- AllDifferent
- AtMostNValue
- ptsplib
- RAPTOR
- Cluster-C
- BBMCL
- Haploview
- gSpan
- CFinder
- Orbiter
- Algorithm 447
- Game Theory Explorer
- GamePlan
- LTR_FINDER
- Repseek
- XGame
- Varun
- CLIP
- json2run
- Havana
- R-CHIE
- BBMCSP
- biicode
- FES
- LPMode
- FacetNet
- GraphScope
- KronFit
- Indclus
- MTBA
- BITSCAN
- G-MAPSEQ
- cliques
- perprof-py
- BicPAM
- In-Close
- popt4jlib
- 2L_enum
- ChemmineR
- GR-Align
- GreedyBB
- MADMX
- MotifCut
- The journey of graph kernels through two decades
- A branch-and-cut algorithm for the pallet loading problem
- BAPS 2
- MCODE
- ProClust
- Clique-detection models in computational biochemistry and genomics
- CliquePercolation
- Formigramator
- CoCoNAD
- LCM
- An exact algorithm for the pallet loading problem
- Facets for node packing
- TABARIS: An exact algorithm based on tabu search for finding a maximum independent set in a graph
- Improvements to MCS algorithm for the maximum clique problem
- An algorithm for finding a maximum clique in a graph
- Solving the maximum clique problem using a tabu search approach
- Efficiently enumerating all maximal cliques with bit-parallelism
- Enumerating maximal cliques in link streams with durations
- On identifying dominant cliques.
- Subgraph isomorphism, matching relational structures and maximal cliques
- Distributed and sequential algorithms for bioinformatics
- A linear time algorithm for maximal clique enumeration in large sparse graphs
- Efficient automated pallet loading
This page was built for software: Algorithm 457
