Q6089669
type: Item
instance of: scholarly article
author: Tuukka Korhonen
publication date: 2023-11-13T00:00:00Z
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 68Q27
Mathematics Subject Classification ID: 68Wxx
zbMATH DE Number: 7764113
zbMATH Keywords: treewidth
zbMATH Keywords: minimum fill-in
zbMATH Keywords: perfect phylogeny
zbMATH Keywords: fractional hypertreewidth
zbMATH Keywords: potential maximal cliques
zbMATH Keywords: edge clique cover
MaRDI profile type: Publication
cites work: GENERATING ALL THE MINIMAL SEPARATORS OF A GRAPH
cites work: Fourier meets M\"{o}bius: fast subset convolution
cites work: Identifying phylogenetic trees
cites work: Treewidth and minimum fill-in: Grouping the minimal separators
cites work: Listing all potential maximal cliques of a graph
cites work: Treewidth and pathwidth parameterized by the vertex cover number
cites work: Known Algorithms for Edge Clique Cover are Probably Optimal
cites work: Q5111890
cites work: On the tractability of optimization problems on \(H\)-graphs
cites work: Exact Algorithms for Treewidth and Minimum Fill-In
cites work: Algorithms parameterized by vertex cover and modular width, through potential maximal cliques
cites work: Large Induced Subgraphs via Triangulations and CMSO
cites work: A revisit of the scheme for computing treewidth and minimum fill-in
cites work: Constraint solving via fractional edge covers
cites work: Minimal Triangulation Algorithms for Perfect Phylogeny Problems
cites work: A Parameterized Algorithm for Chordal Sandwich
cites work: Bayesian Networks and Decision Graphs
cites work: A Fast Algorithm for the Computation and Enumeration of Perfect Phylogenies
cites work: Solving Graph Problems via Potential Maximal Cliques
cites work: Beyond classes of graphs with ``few'' minimal separators: FPT results through potential maximal cliques
cites work: On the complexity of computing treelength
cites work: Computing hypergraph width measures exactly
cites work: Q4792088
cites work: Space-optimal, backtracking algorithms to list the minimal vertex separators of a graph
cites work: Positive-instance driven dynamic programming for treewidth
DOI: 10.4230/LIPICS.IPEC.2020.22
Recommended article: Finding optimal triangulations parameterized by edge clique cover
Recommended article: Known Algorithms for Edge Clique Cover are Probably Optimal
Recommended article: Edge‐maximal triangulated subgraphs and heuristics for the maximum clique problem
Recommended article: Fast constructive and improvement heuristics for edge clique covering
Recommended article: Optimal partial clique edge covering guided by potential energy minimization
Recommended article: Covering triangles in edge-weighted graphs
Recommended article: Vertex and edge covers with clustering properties: Complexity and algorithms
Recommended article: Applications of edge coverings by cliques
Recommended article: Q5150561
description: scientific article; zbMATH DE number 7764113