scientific article; zbMATH DE number 7764113
From MaRDI portal
Publication:6089669
DOI10.4230/LIPICS.IPEC.2020.22MaRDI QIDQ6089669FDOQ6089669
Authors: Tuukka Korhonen 
Publication date: 13 November 2023
Title of this publication is not available (Why is that?)
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
treewidthperfect phylogenypotential maximal cliquesedge clique coverminimum fill-infractional hypertreewidth
Analysis of algorithms and problem complexity (68Q25) Algorithms in computer science (68Wxx) Parameterized complexity, tractability and kernelization (68Q27)
Cites Work
- Title not available (Why is that?)
- Bayesian Networks and Decision Graphs
- Large Induced Subgraphs via Triangulations and CMSO
- Listing all potential maximal cliques of a graph
- A revisit of the scheme for computing treewidth and minimum fill-in
- Treewidth and minimum fill-in: Grouping the minimal separators
- Exact Algorithms for Treewidth and Minimum Fill-In
- GENERATING ALL THE MINIMAL SEPARATORS OF A GRAPH
- Minimal Triangulation Algorithms for Perfect Phylogeny Problems
- Space-optimal, backtracking algorithms to list the minimal vertex separators of a graph
- On the complexity of computing treelength
- Fourier meets M\"{o}bius: fast subset convolution
- Identifying phylogenetic trees
- Treewidth and pathwidth parameterized by the vertex cover number
- A parameterized algorithm for chordal sandwich
- Computing hypergraph width measures exactly
- A Fast Algorithm for the Computation and Enumeration of Perfect Phylogenies
- Beyond classes of graphs with ``few minimal separators: FPT results through potential maximal cliques
- Positive-instance driven dynamic programming for treewidth
- The PACE 2017 parameterized algorithms and computational experiments challenge: the second iteration
- On the tractability of optimization problems on \(H\)-graphs
- Solving graph problems via potential maximal cliques: an experimental evaluation of the Bouchitté-Todinca algorithm
Cited In (2)
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)
