scientific article; zbMATH DE number 7764113
From MaRDI portal
Publication:6089669
DOI10.4230/lipics.ipec.2020.22MaRDI QIDQ6089669
Publication date: 13 November 2023
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
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)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Treewidth and pathwidth parameterized by the vertex cover number
- Computing hypergraph width measures exactly
- Space-optimal, backtracking algorithms to list the minimal vertex separators of a graph
- Beyond classes of graphs with ``few minimal separators: FPT results through potential maximal cliques
- On the complexity of computing treelength
- Listing all potential maximal cliques of a graph
- Algorithms parameterized by vertex cover and modular width, through potential maximal cliques
- On the tractability of optimization problems on \(H\)-graphs
- Positive-instance driven dynamic programming for treewidth
- A revisit of the scheme for computing treewidth and minimum fill-in
- Identifying phylogenetic trees
- Treewidth and Minimum Fill-in: Grouping the Minimal Separators
- Large Induced Subgraphs via Triangulations and CMSO
- Bayesian Networks and Decision Graphs
- Known Algorithms for Edge Clique Cover are Probably Optimal
- Fourier meets M\"{o}bius: fast subset convolution
- A Parameterized Algorithm for Chordal Sandwich
- Constraint solving via fractional edge covers
- Exact Algorithms for Treewidth and Minimum Fill-In
- A Fast Algorithm for the Computation and Enumeration of Perfect Phylogenies
- Solving Graph Problems via Potential Maximal Cliques
- GENERATING ALL THE MINIMAL SEPARATORS OF A GRAPH
- Minimal Triangulation Algorithms for Perfect Phylogeny Problems
This page was built for publication:
