Edge‐maximal triangulated subgraphs and heuristics for the maximum clique problem
From MaRDI portal
Publication:4285462
Recommendations
- Finding a Maximum Clique in an Arbitrary Graph
- A new algorithm for the maximum-weight clique problem
- A fast algorithm for finding an edge-maximal subgraph with a TR-formative coloring
- Minimum Weighted Coloring of Triangulated Graphs, with Application to Maximum Weight Vertex Packing and Clique Finding in Arbitrary Graphs
- A pivoting-based heuristic for the maximum clique problem.
Cited in
(15)- Iterative proportional scaling via decomposable submodels for contingency tables
- A fast algorithm for finding an edge-maximal subgraph with a TR-formative coloring
- The maximum clique problem
- Subgraph extraction and metaheuristics for the maximum clique problem
- scientific article; zbMATH DE number 7764113 (Why is no real title available?)
- A vertex incremental approach for maintaining chordality
- A generalization of chordal graphs and the maximum clique problem
- Chordal editing is fixed-parameter tractable
- Minimal triangulations of graphs: a survey
- Maximal sub-triangulation in pre-processing phylogenetic data
- Additive approximation for edge-deletion problems
- Finding optimal triangulations parameterized by edge clique cover
- A polyhedral study of the maximum edge subgraph problem
- Weighted and unweighted maximum clique algorithms with upper bounds from fractional coloring
- A network-flow-based lower bound for the minimum weighted integer coloring problem
This page was built for publication: Edge‐maximal triangulated subgraphs and heuristics for the maximum clique problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4285462)
