scientific article; zbMATH DE number 7764113

DOI10.4230/LIPICS.IPEC.2020.22MaRDI QIDQ6089669zbMATH OpenFDO

Authors Tuukka Korhonen

Publication date 13 November 2023

zbMATH Keywords

treewidthperfect phylogenypotential maximal cliquesedge clique coverminimum fill-infractional hypertreewidth

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Algorithms in computer science (68Wxx) Parameterized complexity, tractability and kernelization (68Q27)

Recommendations

• Finding optimal triangulations parameterized by edge clique cover
• Edge‐maximal triangulated subgraphs and heuristics for the maximum clique problem
• Fast constructive and improvement heuristics for edge clique covering
• Optimal partial clique edge covering guided by potential energy minimization
• Covering triangles in edge-weighted graphs
• Vertex and edge covers with clustering properties: Complexity and algorithms
• Applications of edge coverings by cliques
• scientific article; zbMATH DE number 7310192

Cites work

• scientific article; zbMATH DE number 1865935 (Why is no real title available?)
• A Fast Algorithm for the Computation and Enumeration of Perfect Phylogenies
• A parameterized algorithm for chordal sandwich
• A revisit of the scheme for computing treewidth and minimum fill-in
• Bayesian Networks and Decision Graphs
• Beyond classes of graphs with ``few minimal separators: FPT results through potential maximal cliques
• Computing hypergraph width measures exactly
• Exact Algorithms for Treewidth and Minimum Fill-In
• Fourier meets M\"{o}bius: fast subset convolution
• GENERATING ALL THE MINIMAL SEPARATORS OF A GRAPH
• Identifying phylogenetic trees
• Large Induced Subgraphs via Triangulations and CMSO
• Listing all potential maximal cliques of a graph
• Minimal Triangulation Algorithms for Perfect Phylogeny Problems
• On the complexity of computing treelength
• On the tractability of optimization problems on \(H\)-graphs
• Positive-instance driven dynamic programming for treewidth
• Solving graph problems via potential maximal cliques: an experimental evaluation of the Bouchitté-Todinca algorithm
• Space-optimal, backtracking algorithms to list the minimal vertex separators of a graph
• The PACE 2017 parameterized algorithms and computational experiments challenge: the second iteration
• Treewidth and minimum fill-in: Grouping the minimal separators
• Treewidth and pathwidth parameterized by the vertex cover number

Cited in

(1)

• Finding optimal triangulations parameterized by edge clique cover

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6089669)