scientific article; zbMATH DE number 7053390
From MaRDI portal
Publication:5743514
Graph algorithms (graph-theoretic aspects) (05C85) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Analysis of algorithms (68W40)
Recommendations
- Subexponential parameterized algorithm for minimum fill-in
- Faster Parameterized Algorithms for Minimum Fill-In
- Faster parameterized algorithms for \textsc{Minimum Fill-in}
- A Polynomial Approximation Algorithm for the Minimum Fill-In Problem
- scientific article; zbMATH DE number 1775386
- Subexponential parameterized algorithm for interval completion
- Subexponential parameterized algorithms
- Subexponential Parameterized Algorithms
- Subexponential parameterized algorithm for {\textsc{Interval Completion}}
- Minimum Fill-In: Inapproximability and Almost Tight Lower Bounds
Cites work
- A characterisation of rigid circuit graphs
- A Deterministic Subexponential Algorithm for Solving Parity Games
- A linear time algorithm to list the minimal separators of chordal graphs
- A Polynomial Approximation Algorithm for the Minimum Fill-In Problem
- Algorithmic Aspects of Vertex Elimination on Graphs
- Approximating the Minimum Chain Completion problem
- Chordal completions of planar graphs
- Computing Minimal Triangulations in Time O(nalpha log n) = o(n2.376)
- Computing the Minimum Fill-In is NP-Complete
- Direct Methods for Sparse Linear Systems
- Exact Algorithms for Treewidth and Minimum Fill-In
- Exact exponential algorithms.
- Fast FAST
- Faster parameterized algorithms for \textsc{Minimum Fill-in}
- Finding induced subgraphs via minimal triangulations
- Fixed-parameter tractability of graph modification problems for hereditary properties
- Fundamentals of parameterized complexity
- Graph Sandwich Problems
- scientific article; zbMATH DE number 3859178 (Why is no real title available?)
- scientific article; zbMATH DE number 5485472 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1256738 (Why is no real title available?)
- scientific article; zbMATH DE number 554762 (Why is no real title available?)
- scientific article; zbMATH DE number 1927376 (Why is no real title available?)
- scientific article; zbMATH DE number 1775386 (Why is no real title available?)
- scientific article; zbMATH DE number 4121482 (Why is no real title available?)
- scientific article; zbMATH DE number 2203240 (Why is no real title available?)
- scientific article; zbMATH DE number 3420184 (Why is no real title available?)
- scientific article; zbMATH DE number 7053390 (Why is no real title available?)
- scientific article; zbMATH DE number 4184603 (Why is no real title available?)
- Incidence matrices and interval graphs
- Interval Completion Is Fixed Parameter Tractable
- Listing all potential maximal cliques of a graph
- Minimal triangulation of a graph and optimal pivoting order in a sparse matrix
- Minimal triangulations of graphs: a survey
- On rigid circuit graphs
- On the Desirability of Acyclic Database Schemes
- On treewidth and minimum fill-in of asteroidal triple-free graphs
- Parametrized complexity theory.
- Subexponential parameterized algorithms on bounded-genus graphs and H-minor-free graphs
- The hardness of perfect phylogeny, feasible register assignment and other problems on thin colored graphs
- The Use of Linear Graphs in Gauss Elimination
- Tractability of Parameterized Completion Problems on Chordal, Strongly Chordal, and Proper Interval Graphs
- Treewidth and minimum fill-in: Grouping the minimal separators
- Treewidth Computation and Extremal Combinatorics
- Triangulating 3-Colored Graphs
- Two strikes against perfect phylogeny
- Which problems have strongly exponential complexity?
Cited in
(16)- Subexponential parameterized algorithms and kernelization on almost chordal graphs
- Minimum fill-in of sparse graphs: kernelization and approximation
- Faster parameterized algorithms for deletion to split graphs
- Exploring the subexponential complexity of completion problems
- Searching for better fill-in
- Exploring subexponential parameterized complexity of completion problems
- Faster Parameterized Algorithms for Minimum Fill-In
- Fast Computation of Minimal Fill Inside A Given Elimination Ordering
- Minimum Fill-In: Inapproximability and Almost Tight Lower Bounds
- On the minimum chordal completion polytope
- Minimum Fill-In and Treewidth of Split+ ke and Split+ kv Graphs
- Subexponential parameterized algorithm for minimum fill-in
- scientific article; zbMATH DE number 7053390 (Why is no real title available?)
- A Subexponential Parameterized Algorithm for Proper Interval Completion
- Faster parameterized algorithms for \textsc{Minimum Fill-in}
- The necessary and sufficient condition and the efficient algorithms for gradually varied fill
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 Q5743514)
