Pages that link to "Item:Q4124209"
From MaRDI portal
The following pages link to Algorithmic Aspects of Vertex Elimination on Graphs (Q4124209):
Displaying 50 items.
- A generalization of chordal graphs and the maximum clique problem (Q287036) (← links)
- The recognition of geodetically connected graphs (Q293190) (← links)
- Consecutive retrieval property -- revisited (Q294594) (← links)
- Recognizing \(i\)-triangulated graphs in \(O(mn)\) time (Q294870) (← links)
- Largest chordal and interval subgraphs faster than \(2^n\) (Q329301) (← links)
- Differential geometric treewidth estimation in adiabatic quantum computation (Q332093) (← links)
- A new LBFS-based algorithm for cocomparability graph recognition (Q344849) (← links)
- On recognition of threshold tolerance graphs and their complements (Q344853) (← links)
- Minimal dominating sets in graph classes: combinatorial bounds and enumeration (Q387008) (← links)
- A note on perfect partial elimination (Q389218) (← links)
- Two characterisations of the minimal triangulations of permutation graphs (Q390311) (← links)
- Organizing the atoms of the clique separator decomposition into an atom tree (Q406311) (← 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)
- A survey of the algorithmic aspects of modular decomposition (Q458504) (← links)
- Decomposition by maxclique separators (Q465285) (← links)
- Certifying algorithms (Q465678) (← links)
- Practical and efficient circle graph recognition (Q472484) (← links)
- Practical and efficient split decomposition via graph-labelled trees (Q472485) (← links)
- Clique coloring \(B_1\)-EPG graphs (Q512582) (← links)
- A linear-time algorithm for clique-coloring problem in circular-arc graphs (Q512872) (← links)
- Strict chordal and strict split digraphs (Q516787) (← links)
- On sequential heuristic methods for the maximum independent set problem (Q521760) (← links)
- Extending partial representations of proper and unit interval graphs (Q524367) (← links)
- End-vertices of LBFS of (AT-free) bigraphs (Q528559) (← 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)
- A general label search to investigate classical graph search algorithms (Q617648) (← links)
- Implementation of nonsymmetric interior-point methods for linear optimization over sparse matrix cones (Q621748) (← links)
- Minimal free resolutions of linear edge ideals (Q627986) (← links)
- The importance of structure in incomplete factorization preconditioners (Q634121) (← links)
- PRM inference using Jaffray \& Faÿ's local conditioning (Q649983) (← links)
- Strongly chordal and chordal bipartite graphs are sandwich monotone (Q652637) (← links)
- Beyond classes of graphs with ``few'' minimal separators: FPT results through potential maximal cliques (Q666659) (← links)
- Minimal obstructions for partial representations of interval graphs (Q668026) (← links)
- A linear-time algorithm for proper interval graph recognition (Q672268) (← links)
- A note on lexicographic breadth first search for chordal graphs (Q673001) (← links)
- On the SPANNING \(k\)-TREE problem (Q686254) (← links)
- A new algorithm for decomposition of graphical models (Q692688) (← links)
- Enumeration of the perfect sequences of a chordal graph (Q708216) (← links)
- Treewidth and minimum fill-in on permutation graphs in linear time (Q708222) (← links)
- The isomorphism problem for \(k\)-trees is complete for logspace (Q714733) (← links)
- An \(O(nm)\)-time certifying algorithm for recognizing HHD-free graphs (Q714793) (← links)
- The solution space of sorting with recurring comparison faults (Q726101) (← links)
- Algorithms for unipolar and generalized split graphs (Q741738) (← links)
- Efficient algorithms for network localization using cores of underlying graphs (Q742409) (← links)
- Maximum induced matching problem on hhd-free graphs (Q765362) (← links)
- Domination, independent domination, and duality in strongly chordal graphs (Q788002) (← links)
- Some aspects of perfect elimination orderings in chordal graphs (Q792351) (← links)
- Calculs de complexité relatifs à une méthode de dissection emboîtée (Q792734) (← links)
