scientific article; zbMATH DE number 554762
From MaRDI portal
Publication:4288578
Recommendations
Cited in
(only showing first 100 items - show all)- Chordal networks of polynomial ideals
- Tight bounds for chordal/interval vertex deletion parameterized by treewidth
- Semi-dynamic algorithms for strongly chordal graphs
- Totally nonpositive completions on partial matrices
- Minimum Fill-In and Treewidth of Split+ ke and Split+ kv Graphs
- Efficient enumeration of maximal \(k\)-degenerate induced subgraphs of a chordal graph
- Choosing better variable orderings for cylindrical algebraic decomposition via exploiting chordal structure
- A new characterization of \(k\)-trees and some applications
- Complexity of finding maximum regular induced subgraphs with prescribed degree
- Chordal decomposition in operator-splitting methods for sparse semidefinite programs
- A Characterisation of the Minimal Triangulations of Permutation Graphs
- Block-indifference graphs: characterization, structural and spectral properties
- The completable digraphs for the totally nonnegative completion problem
- Decomposition methods for sparse matrix nearness problems
- Separator orders in interval, cocomparability, and AT-free graphs
- Inductive \(k\)-independent graphs and \(c\)-colorable subgraphs in scheduling: a review
- Tree-structured graphs
- Robust principal component analysis using facial reduction
- Multiplicity adjustment for temporal and spatial scan statistics using Markov property
- Compatibility, desirability, and the running intersection property
- Structural conditions for cycle completable graphs
- A Correlatively Sparse Lagrange Multiplier Expression Relaxation for Polynomial Optimization
- Detecting fixed patterns in chordal graphs in polynomial time
- A direct proof for the matrix decomposition of chordal-structured positive semidefinite matrices
- scientific article; zbMATH DE number 653261 (Why is no real title available?)
- Clique neighborhoods and nearly chordal graphs
- Multi-word-representability of graphs
- Organizing the atoms of the clique separator decomposition into an atom tree
- Tree decomposition and discrete optimization problems: a survey
- CS-TSSOS: correlative and term sparsity for large-scale polynomial optimization
- Distributed Minimum Vertex Coloring and Maximum Independent Set in Chordal Graphs
- A parallel interior point decomposition algorithm for block angular semidefinite programs
- A new algorithm for decomposition of graphical models
- An improved Hara-Takamura procedure by sharing computations on junction tree in Gaussian graphical models
- Chordal graphs and their clique graphs
- Treewidth versus clique number. II: Tree-independence number
- Subgraph trees in graph theory
- A Fully Dynamic Graph Algorithm for Recognizing Proper Interval Graphs
- Enumeration of the perfect sequences of a chordal graph
- Linear optimization over homogeneous matrix cones
- Recognition of chordal graphs and cographs which are cover-incomparability graphs
- A vertex incremental approach for maintaining chordality
- scientific article; zbMATH DE number 2170436 (Why is no real title available?)
- A multigrid approach to SDP relaxations of sparse polynomial optimization problems
- A tight approximation algorithm for the cluster vertex deletion problem
- A tight approximation algorithm for the cluster vertex deletion problem
- Generating and characterizing the perfect elimination orderings of a chordal graph
- Recognizing underlying sparsity in optimization
- Recognizing k -Leaf Powers in Polynomial Time, for Constant k
- A spatial branch-and-cut method for nonconvex QCQP with bounded complex variables
- Searching for better fill-in
- Chordal digraphs
- Matrix completion and decomposition in phase-bounded cones
- A local method for identifying causal relations under Markov equivalence
- Structural balance and interpersonal appraisals dynamics: beyond all-to-all and two-faction networks
- Sparse polynomial optimization with unbounded sets
- A story of diameter, radius, and (almost) Helly property
- Integer Laplacian eigenvalues of chordal graphs
- Generalized chordality, vertex separators and hyperbolicity on graphs
- A simple algorithm to find Hamiltonian cycles in proper interval graphs
- Clique trees of infinite locally finite chordal graphs
- Recursive sum-product algorithm for generalized outer-planar graphs
- Graph Bipartization Problem with Applications to Via Minimization in VLSI Design
- Computing the clique-separator graph for an interval graph in linear time
- \(P\)-matrix completions under weak symmetry assumptions
- On basic chordal graphs and some of its subclasses
- Eccentricity spectral radius of t-clique trees with given diameter
- Finding biclique partitions of co-chordal graphs
- Minimal triangulations of graphs: a survey
- Positive polynomials on projective limits of real algebraic varieties
- Treewidth distance on phylogenetic trees
- Enclosing ellipsoids and elliptic cylinders of semialgebraic sets and their application to error bounds in polynomial optimization
- The \(N\)-matrix completion problem under digraphs assumptions.
- Multigraph representations of hierarchical loglinear models
- Reduced clique graphs of chordal graphs
- Polynomial-time algorithms for subgraph isomorphism in small graph classes of perfect graphs
- The complexity of subtree intersection representation of chordal graphs and linear time chordal graph generation
- Partial Lasserre relaxation for sparse Max-Cut
- Chordal digraphs
- Clique trees of chordal graphs: leafage and 3-asteroidals
- Computing role assignments of chordal graphs
- Characterization of \textit{quasi}-threshold graphs with two main \(Q\)-eigenvalues
- Exploiting sparsity in linear and nonlinear matrix inequalities via positive semidefinite matrix completion
- The symmetric inverse M-matrix completion problem
- Neural networks for facility location problems
- Fully dynamic algorithm for chordal graphs with \(O(1)\) query-time and \(O(n^2)\) update-time
- An introduction to clique minimal separator decomposition
- Graph extremities defined by search algorithms
- Detecting \(K_{2,3}\) as an induced minor
- Sum of squares method for sensor network localization
- Fast minimal triangulation algorithm using minimum degree criterion
- On strictly chordality-\(k\) graphs
- An efficient representation of chordal graphs
- Doubly nonnegative relaxations for quadratic and polynomial optimization problems with binary and box constraints
- The scattering number of strictly chordal graphs: linear time determination
- scientific article; zbMATH DE number 7053390 (Why is no real title available?)
- Fast implementation of the traveling-salesman-problem method for reordering columns within supernodes
- Recognizing Proper Tree-Graphs
- MCMC using Markov bases for computing p-values in decomposable log-linear models
- Maximal sub-triangulation in pre-processing phylogenetic data
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 Q4288578)
