Edge‐maximal triangulated subgraphs and heuristics for the maximum clique problem
From MaRDI portal
Publication:4285462
DOI10.1002/net.3230240208zbMath0791.90065OpenAlexW2050368127MaRDI QIDQ4285462
Publication date: 13 July 1994
Published in: Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/net.3230240208
Related Items (11)
Minimal triangulations of graphs: a survey ⋮ A vertex incremental approach for maintaining chordality ⋮ Subgraph extraction and metaheuristics for the maximum clique problem ⋮ A generalization of chordal graphs and the maximum clique problem ⋮ Chordal editing is fixed-parameter tractable ⋮ Additive approximation for edge-deletion problems ⋮ Weighted and unweighted maximum clique algorithms with upper bounds from fractional coloring ⋮ Iterative proportional scaling via decomposable submodels for contingency tables ⋮ Maximal sub-triangulation in pre-processing phylogenetic data ⋮ A network-flow-based lower bound for the minimum weighted integer coloring problem ⋮ The maximum clique problem
Cites Work
This page was built for publication: Edge‐maximal triangulated subgraphs and heuristics for the maximum clique problem
