Chordal

swMATH27125MaRDI QIDQ38843FDOQ38843

Author name not available (Why is that?)

Described by source

• Exploiting chordal structure in polynomial ideals: a Gröbner bases approach

Cited In (9)

• Choosing better variable orderings for cylindrical algebraic decomposition via exploiting chordal structure
• The m-Bézout bound and distance geometry
• Random sampling in computational algebra: Helly numbers and violator spaces
• Analyses and implementations of chordality-preserving top-down algorithms for triangular decomposition
• Chordal Networks of Polynomial Ideals
• Chordal graphs in triangular decomposition in top-down style
• Chordality Preserving Incremental Triangular Decomposition and Its Implementation
• On the robust hardness of Gröbner basis computation
• Exploiting sparsity for semi-algebraic set volume computation

This page was built for software: Chordal