Pages that link to "Item:Q3960122"
From MaRDI portal
The following pages link to Computing the Minimum Fill-In is NP-Complete (Q3960122):
Displayed 50 items.
- The homogeneous set sandwich problem (Q293307) (← links)
- Chordal editing is fixed-parameter tractable (Q300460) (← links)
- Planar disjoint-paths completion (Q329285) (← links)
- Graphs with maximal induced matchings of the same size (Q344824) (← links)
- Graph modification problem for some classes of graphs (Q350726) (← links)
- An \(\mathcal O(n^2)\)-time algorithm for the minimal interval completion problem (Q391090) (← links)
- Polynomial kernels for proper interval completion and related problems (Q393083) (← links)
- Discovering a junction tree behind a Markov network by a greedy algorithm (Q402234) (← links)
- On sparse matrix orderings in interior point methods (Q402236) (← links)
- Creating non-minimal triangulations for use in inference in mixed stochastic/deterministic graphical models (Q415616) (← links)
- Fully dynamic algorithm for chordal graphs with \(O(1)\) query-time and \(O(n^2)\) update-time (Q442287) (← links)
- Unit interval editing is fixed-parameter tractable (Q515577) (← links)
- Influence of matrix reordering on the performance of iterative methods for solving linear systems arising from interior point methods for linear programming (Q522098) (← links)
- Fast minimal triangulation algorithm using minimum degree criterion (Q551209) (← links)
- A direct active set algorithm for large sparse quadratic programs with simple bounds (Q583116) (← links)
- Faster parameterized algorithms for \textsc{Minimum Fill-in} (Q652537) (← links)
- Strongly chordal and chordal bipartite graphs are sandwich monotone (Q652637) (← links)
- \(K_{1,3}\)-free and \(W_4\)-free graphs (Q673353) (← links)
- Treewidth and minimum fill-in on permutation graphs in linear time (Q708222) (← links)
- Parallel sparse Gaussian elimination with partial pivoting (Q753685) (← links)
- Minimal triangulations of graphs: a survey (Q819823) (← links)
- A vertex incremental approach for maintaining chordality (Q819824) (← links)
- A linear time algorithm to list the minimal separators of chordal graphs (Q819826) (← links)
- Lex M versus MCS-M (Q819832) (← links)
- Minimal split completions (Q967310) (← links)
- Minimum fill-in and treewidth of split \(+ ke\) and split \(+kv\) graphs (Q972334) (← links)
- Characterizing and computing minimal cograph completions (Q972335) (← links)
- Chordal deletion is fixed-parameter tractable (Q973007) (← links)
- On listing, sampling, and counting the chordal graphs with edge constraints (Q974754) (← links)
- Near-optimal solutions for the generalized max-controlled set problem (Q976048) (← links)
- Approximating the Minimum Chain Completion problem (Q989547) (← links)
- Single-edge monotonic sequences of graphs and linear-time algorithms for minimal completions and deletions (Q1001894) (← links)
- Coreduction homology algorithm (Q1006400) (← links)
- The graph sandwich problem for \(P_4\)-sparse graphs (Q1025565) (← links)
- Exploiting special structure in semidefinite programming: a survey of theory and applications (Q1044129) (← links)
- Decomposition by clique separators (Q1062072) (← links)
- Efficient algorithms for combinatorial problems on graphs with bounded decomposability - a survey (Q1062758) (← links)
- Efficient solutions of hierarchical systems of linear equations (Q1089723) (← links)
- Bipartite permutation graphs (Q1092931) (← links)
- The analysis of a nested dissection algorithm (Q1103322) (← links)
- Maximal chordal subgraphs (Q1115455) (← links)
- Solution of sparse positive definite systems on a hypercube (Q1124265) (← links)
- An appraisal of computational complexity for operations researchers (Q1173532) (← links)
- The average parallel complexity of Cholesky factorization (Q1192153) (← links)
- The complexity of reconstructing trees from qualitative characters and subtrees (Q1203103) (← links)
- Triangulating graphs with few \(P_4\)'s (Q1281383) (← links)
- Decomposing constraint satisfaction problems using database techniques (Q1321054) (← links)
- An efficient parallel algorithm for the minimal elimination ordering (MEO) of an arbitrary graph (Q1341730) (← links)
- Finding minimum height elimination trees for interval graphs in polynomial time (Q1347072) (← links)
- Fixed-parameter tractability of graph modification problems for hereditary properties (Q1352005) (← links)