Imagen de Portada

Learning Minimally Rigid Graphs with High Realization Counts

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Slyvka, Oleksandr, Rubeš, Jan, Alves, Rodrigo, Legerský, Jan
Formato:	Preprint
Publicado:	2026
Materias:	Machine Learning Combinatorics 52C25, 68R12
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Flexible realizations existence: NP-completeness on sparse graphs and algorithms
por: Laštovička, Petr, et al.
Publicado: (2024)

The number of realisations of a random graph
por: Dewar, Sean, et al.
Publicado: (2026)

The number of realisations of a rigid graph in Euclidean and spherical geometries
por: Dewar, Sean, et al.
Publicado: (2023)

Robinson spaces and their representation in low-dimensional metric spaces
por: Arrepol, Francisco, et al.
Publicado: (2026)

Flexibility and rigidity of frameworks consisting of triangles and parallelograms
por: Grasegger, Georg, et al.
Publicado: (2023)

The $d$-dimensional realisation number of a rigid graph
por: Dewar, Sean, et al.
Publicado: (2026)

Constructing reflection-symmetric flexible realisations of graphs
por: Dewar, Sean, et al.
Publicado: (2024)

General uncrossing covering paths inside the axis-aligned bounding box
por: Ripà, Marco
Publicado: (2024)

Computing the number of realisations of a rigid graph
por: Dewar, Sean, et al.
Publicado: (2025)

Stable cuts, NAC-colourings and flexible realisations of graphs
por: Clinch, Katie, et al.
Publicado: (2024)

Generic Rigidity of Graph Frameworks in Euclidean Space
por: Heaton, Alexander
Publicado: (2026)

Rigidity of Circle Packings with Flexible Radii
por: Connelly, Robert, et al.
Publicado: (2022)

On Minimal Depth in Neural Networks
por: Valerdi, Juan L.
Publicado: (2024)

Quantum computing algorithms for inverse problems on graphs and an NP-complete inverse problem
por: Ilmavirta, Joonas, et al.
Publicado: (2023)

Morse theory and moduli spaces of self-avoiding polygonal linkages
por: Ba, Te, et al.
Publicado: (2025)

$(t,r)$ Broadcast Domination Numbers and Densities of the Truncated Square Tiling Graph
por: Cervantes, Jillian, et al.
Publicado: (2024)

Realizations of multiassociahedra via rigidity
por: Ruiz, Luis Crespo, et al.
Publicado: (2022)

Rigidity of Graphs and Frameworks: A Matroid Theoretic Approach
por: Cruickshank, James, et al.
Publicado: (2025)

Eight-Partitioning Points in 3D, and Efficiently Too
por: Aronov, Boris, et al.
Publicado: (2024)

Minimally rigid tensegrity frameworks
por: Clay, Adam D. W., et al.
Publicado: (2024)

Degree Sum Conditions for Graph Rigidity
por: Jordán, Tibor, et al.
Publicado: (2025)

Orientation-Reversing Crystallographic Rigidity
por: Esson, Jack, et al.
Publicado: (2025)

Lower General Position Sets in Graphs
por: Di Stefano, Gabriele, et al.
Publicado: (2023)

Counting Frameworks of Bipyramids
por: Southgate, Jack
Publicado: (2023)

On the convex hull of integer points above the hyperbola
por: Alcántara, David, et al.
Publicado: (2025)

Highly regular vertex-transitive graphs are globally rigid
por: Saliby, Angelo El
Publicado: (2026)

Counting for rigidity under projective transformations in the plane
por: Berman, Leah Wrenn, et al.
Publicado: (2025)

Non-Euclidean Crystallographic Rigidity
por: Esson, Jack, et al.
Publicado: (2025)

An efficient algorithm for generating transmission irregular trees
por: Stošić, Ivan, et al.
Publicado: (2025)

Book crossing numbers of the complete graph and small local convex crossing numbers
por: Ábrego, Bernardo M., et al.
Publicado: (2016)

The rectilinear local crossing number of $K_n$
por: Ábrego, Bernardo M., et al.
Publicado: (2015)

Periodicity and decidability of translational tilings by rational polygonal sets
por: Pont, Jaume de Dios, et al.
Publicado: (2024)

Turtles, Hats and Spectres: Aperiodic structures on a Rhombic tiling
por: Smith, James
Publicado: (2024)

A sharper Ramsey theorem for constrained drawings
por: Paták, Pavel
Publicado: (2019)

Metric representations by minimal graphs
por: Franco-Sánchez, Víctor, et al.
Publicado: (2026)

Reconstructing a graph from the distance matrix of its boundary
por: Cáceres, José, et al.
Publicado: (2024)

The Mutual-Visibility Problem In Directed Graphs
por: Stojanović, Vanja
Publicado: (2026)

The General Position Problem: A Survey
por: V., Ullas Chandran S., et al.
Publicado: (2025)

Perfect Edge Domination in $P_6$-free Graphs and in Graphs Without Efficient Edge Dominating Sets
por: Grippo, Luciano N., et al.
Publicado: (2025)

On Generic Linearly Constrained Frameworks
por: Deniz, Zakir, et al.
Publicado: (2026)