Algorithm 457
From MaRDI portal
Software:37543
swMATH25808MaRDI QIDQ37543FDOQ37543
Author name not available (Why is that?)
Cited In (only showing first 100 items - show all)
- Cliques of a graph-variations on the Bron-Kerbosch algorithm
- Multifidelity Information Fusion Algorithms for High-Dimensional Systems and Massive Data sets
- Subgraph isomorphism, matching relational structures and maximal cliques
- Distributed and sequential algorithms for bioinformatics
- Lower bounds on paraclique density
- Characterizing the complexity of time series networks of dynamical systems: A simplicial approach
- The maximum clique problem
- A linear time algorithm for maximal clique enumeration in large sparse graphs
- Efficient Gaussian graphical model determination under \(G\)-Wishart prior distributions
- Characteristics of the maximal independent set ZDD
- An improved Hara-Takamura procedure by sharing computations on junction tree in Gaussian graphical models
- Exact approaches for integrated aircraft fleeting and routing at TunisAir
- Algorithms for detecting optimal hereditary structures in graphs, with application to clique relaxations
- A branch and bound algorithm for the maximum clique problem
- 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
- A tolerance-based heuristic approach for the weighted independent set problem
- Computing Banzhaf-Coleman and Shapley-Shubik power indices with incompatible players
- A note on the problem of reporting maximal cliques
- A variable neighborhood search heuristic for the maximum ratio clique problem
- 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
- Construction of all DEA efficient surfaces of the production possibility set under the Generalized Data Development Analysis model
- An efficient algorithm for maximum entropy extension of block-circulant covariance matrices
- 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
- Speeding up column generation for robust wireless network planning
- 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
- Title not available (Why is that?)
- Communicability graph and community structures in complex networks
- Solving maximum clique in sparse graphs: an \({O(nm+n2^{d/4})}\) algorithm for \(d\)-degenerate graphs
- The journey of graph kernels through two decades
- Parallel Maximum Clique Algorithms with Applications to Network Analysis
- A branch-and-cut algorithm for the pallet loading problem
- Clique-detection models in computational biochemistry and genomics
- An exact algorithm for the pallet loading problem
- A new exact maximum clique algorithm for large and massive sparse graphs
- Infra-chromatic bound for exact maximum clique search
- What makes a \(\mathbf D_0\) graph Schur positive?
- Facets for node packing
- TABARIS: An exact algorithm based on tabu search for finding a maximum independent set in a graph
- Interesting pattern mining in multi-relational data
- The worst-case time complexity for generating all maximal cliques and computational experiments
- Characteristics and structures of weak efficient surfaces of production possibility sets
- Improvements to MCS algorithm for the maximum clique problem
- A depth first search algorithm to generate the family of maximal independent sets of a graph lexicographically
- An algorithm for finding a maximum clique in a graph
- \textsc{Rime}: repeat identification
- Off-line mapping of multi-rate dependent task sets to many-core platforms
- A classification for community discovery methods in complex networks
- An exact algorithm for the maximum \(k\)-club problem in an undirected graph
- Solving the maximum clique problem using a tabu search approach
- Polynomially solvable cases of the constant rank unconstrained quadratic 0-1 programming problem
- Finding all \(k\)-cliques in \(k\)-partite graphs, an application in textile engineering
- Finding maximum cliques in arbitrary and in special graphs
- A new decomposition technique for maximal clique enumeration for sparse graphs
- A note on bimatrix game maximal Selten subsets
- Efficiently enumerating all maximal cliques with bit-parallelism
- Enumerating maximal cliques in link streams with durations
- Fast maximal cliques enumeration in sparse graphs
- A column generation based algorithm for the robust graph coloring problem
- Heuristics for finding \(k\)-clubs in an undirected graph
- Exact algorithms for maximum clique: a computational study
- Enumerating all connected maximal common subgraphs in two graphs
- A parallel maximum clique algorithm for large and massive sparse graphs
- Finding quasi core with simulated stacked neural networks
- Maximal strongly connected cliques in directed graphs: algorithms and bounds
- Sublinear-space and bounded-delay algorithms for maximal clique enumeration in graphs
- Standardization of the input data in classification problems using the descent vector method
- Adding incompatibilities to the simple plant location problem: formulation, facets and computational experience
- On identifying dominant cliques.
- Noise-Robust Modes of the Retinal Population Code Have the Geometry of “Ridges” and Correspond to Neuronal Communities
- Numerical experiments with LP formulations of the maximum clique problem
- Efficient automated pallet loading
- Solving a selective dial-a-ride problem with logic-based Benders decomposition
- Exact Solution Algorithms for the Chordless Cycle Problem
- Hierarchical sequencing of online social graphs
- An improved upper bound on maximal clique listing via rectangular fast matrix multiplication
- Isolation concepts for clique enumeration: comparison and computational experiments
- Theoretical underpinnings for maximal clique enumeration on perturbed graphs
- Generating all maximal independent sets on trees in lexicographic order
- Daily course pattern formulation and valid inequalities for the curriculum-based course timetabling problem
- Detecting community structure via the maximal sub-graphs and belonging degrees in complex networks
- Accurate optimization models for interference constrained bandwidth allocation in cellular networks
- Structural interpretation of sparse fault data using graph theory and geological rules. Fault data interpretation
- Large-scale clique cover of real-world networks
- A two-level graph partitioning problem arising in mobile wireless communications
- New models and algorithms for RNA pseudoknot order assignment
- On finding and enumerating maximal and maximum \( k\)-partite cliques in \( k\)-partite graphs
- Computing maximal subsemigroups of a finite semigroup
- Preprocessing and cutting planes with conflict graphs
- Game Theory Explorer: software for the applied game theorist
- Fast circular arc segmentation based on approximate circularity and cuboid graph
- Efficient Algorithms for Finding Maximum and Maximal Cliques and Their Applications
This page was built for software: Algorithm 457
