The following pages link to Algorithm 457 (Q37543):
Displaying 50 items.
- Lower bounds on paraclique density (Q266841) (← links)
- The minimal \(k\)-core problem for modeling \(k\)-assemblies (Q282678) (← links)
- Integer programming techniques for the nurse rostering problem (Q284423) (← links)
- Computing Banzhaf-Coleman and Shapley-Shubik power indices with incompatible players (Q298742) (← links)
- Border bases for lattice ideals (Q321275) (← links)
- A computational study of conflict graphs and aggressive cut separation in integer programming (Q324843) (← links)
- A robust optimisation model and cutting planes for the planning of energy-efficient wireless networks (Q339546) (← links)
- Infra-chromatic bound for exact maximum clique search (Q342100) (← links)
- A new exact maximum clique algorithm for large and massive sparse graphs (Q342165) (← links)
- What makes a \(\mathbf D_0\) graph Schur positive? (Q345152) (← links)
- Algorithms for detecting optimal hereditary structures in graphs, with application to clique relaxations (Q360375) (← links)
- Characteristics of the maximal independent set ZDD (Q405673) (← links)
- Finding all solutions of affine generalized Nash equilibrium problems with one-dimensional strategy sets (Q471019) (← links)
- Solving maximum clique in sparse graphs: an \({O(nm+n2^{d/4})}\) algorithm for \(d\)-degenerate graphs (Q479213) (← links)
- Indeterminate strings, prefix arrays \& undirected graphs (Q496001) (← links)
- \textsc{Rime}: repeat identification (Q496543) (← links)
- Off-line mapping of multi-rate dependent task sets to many-core platforms (Q497990) (← links)
- A column generation based algorithm for the robust graph coloring problem (Q516837) (← links)
- A parallel maximum clique algorithm for large and massive sparse graphs (Q526419) (← links)
- Finding quasi core with simulated stacked neural networks (Q526647) (← links)
- Distributed and sequential algorithms for bioinformatics (Q530299) (← links)
- Exact approaches for integrated aircraft fleeting and routing at TunisAir (Q540645) (← links)
- An improved Hara-Takamura procedure by sharing computations on junction tree in Gaussian graphical models (Q693348) (← links)
- An exact bit-parallel algorithm for the maximum clique problem (Q709206) (← links)
- Interesting pattern mining in multi-relational data (Q740605) (← links)
- Speeding up column generation for robust wireless network planning (Q743642) (← links)
- TABARIS: An exact algorithm based on tabu search for finding a maximum independent set in a graph (Q750320) (← links)
- Finding weighted \(k\)-truss communities in large networks (Q778465) (← links)
- A new backtracking algorithm for generating the family of maximal independent sets of a graph (Q786833) (← links)
- Finding maximum cliques in arbitrary and in special graphs (Q807639) (← links)
- Communicability graph and community structures in complex networks (Q833142) (← links)
- Enumeration of Nash equilibria for two-player games (Q847809) (← links)
- Characteristics and structures of weak efficient surfaces of production possibility sets (Q860642) (← links)
- The worst-case time complexity for generating all maximal cliques and computational experiments (Q860810) (← links)
- Lagrangean relaxation with clusters and column generation for the manufacturer's pallet loading problem (Q875414) (← links)
- Computing maximal cliques in link streams (Q897884) (← links)
- Refined pivot selection for maximal clique enumeration in graphs (Q899307) (← links)
- An exact algorithm for the maximum clique problem (Q922964) (← links)
- A note on the problem of reporting maximal cliques (Q955035) (← links)
- Theoretical underpinnings for maximal clique enumeration on perturbed graphs (Q974747) (← links)
- Integral point sets over \(\mathbb Z_n^m\) (Q1026112) (← links)
- Isolation concepts for clique enumeration: comparison and computational experiments (Q1040581) (← links)
- An appraisal of the performance of the MMSC subgraph generation algorithm on a Cyber system 170/720 (Q1077167) (← links)
- Clique detection for nondirected graphs: Two new algorithms (Q1143177) (← links)
- An algorithm for generating all maximal independent subsets of posets (Q1147517) (← links)
- A depth first search algorithm to generate the family of maximal independent sets of a graph lexicographically (Q1157909) (← links)
- A versatile system for computer-controlled assembly (Q1216189) (← links)
- Subgraph isomorphism, matching relational structures and maximal cliques (Q1245239) (← links)
- An algorithm for finding a maximum clique in a graph (Q1267190) (← links)
- Construction of all DEA efficient surfaces of the production possibility set under the Generalized Data Development Analysis model (Q1278409) (← links)