Enumerating combinatorial resultant trees

DOI10.1016/j.comgeo.2023.102064zbMATH Open1543.05085MaRDI QIDQ6579118

Goran Malić, Ileana Streinu

Publication date: 25 July 2024

Published in: Computational Geometry (Search for Journal in Brave)

zbMATH Keywords

inductive constructionrigidity matroidcircuit polynomialcombinatorial resultantresultant tree

Mathematics Subject Classification ID

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

Cites Work

• On some combinatorial properties of algebraic matroids
• Enumerating constrained non-crossing minimally rigid frameworks
• A pivoting algorithm for convex hulls and vertex enumeration of arrangements and polyhedra
• An algorithm for two-dimensional rigidity percolation: The pebble game
• A proof of Connelly's conjecture on 3-connected circuits of the rigidity matroid.
• Reverse search for enumeration
• Practical graph isomorphism. II.
• Pebble game algorithms and sparse graphs
• Dividing a Graph into Triconnected Components
• Algebraic Matroids in Action
• Computing Circuit Polynomials in the Algebraic Rigidity Matroid
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Enumerating combinatorial resultant trees