Enumerating combinatorial resultant trees

DOI10.1016/J.COMGEO.2023.102064MaRDI QIDQ6579118zbMATH OpenFDO

Authors Goran Malić, Ileana Streinu

Publication date 25 July 2024

Published in Computational Geometry (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.COMGEO.2023.102064

zbMATH Keywords

circuit polynomialcombinatorial resultantinductive constructionresultant treerigidity matroid

Mathematics Subject Classification ID

Combinatorial aspects of matroids and geometric lattices (05B35) Trees (05C05) Enumeration in graph theory (05C30) Graph polynomials (05C31)

Recommendations

• Computing Circuit Polynomials in the Algebraic Rigidity Matroid
• Generating all rigidity circuits on at most 10 vertices and all Assur graphs on at most 11 vertices
• Algorithms for graph rigidity and scene analysis
• On characterizations of rigid graphs in the plane using spanning trees
• Algorithms for the d-Dimensional Rigidity Matroid of Sparse Graphs

Cites work

• A pivoting algorithm for convex hulls and vertex enumeration of arrangements and polyhedra
• A proof of Connelly's conjecture on 3-connected circuits of the rigidity matroid.
• Algebraic matroids in action
• An algorithm for two-dimensional rigidity percolation: The pebble game
• Computing Circuit Polynomials in the Algebraic Rigidity Matroid
• Dividing a Graph into Triconnected Components
• Enumerating constrained non-crossing minimally rigid frameworks
• scientific article; zbMATH DE number 177843 (Why is no real title available?)
• scientific article; zbMATH DE number 3534506 (Why is no real title available?)
• scientific article; zbMATH DE number 2080088 (Why is no real title available?)
• scientific article; zbMATH DE number 7359928 (Why is no real title available?)
• scientific article; zbMATH DE number 5873618 (Why is no real title available?)
• scientific article; zbMATH DE number 3236772 (Why is no real title available?)
• On some combinatorial properties of algebraic matroids
• Pebble game algorithms and sparse graphs
• Practical graph isomorphism. II.
• Reverse search for enumeration

This page was built for publication: Enumerating combinatorial resultant trees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6579118)