Imagen de Portada

Further Connectivity Results on Plane Spanning Path Reconfiguration

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Boucard, Valentino, da Fonseca, Guilherme D., Rivier, Bastien
Formato:	Preprint
Publicado:	2024
Materias:	Computational Geometry Discrete Mathematics
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

On the Connectivity of the Flip Graph of Plane Spanning Paths
por: Kleist, Linda, et al.
Publicado: (2024)

Constrained Flips in Plane Spanning Trees
por: Aichholzer, Oswin, et al.
Publicado: (2025)

Structural Properties of Shortest Flip Sequences Between Plane Spanning Trees
por: Aichholzer, Oswin, et al.
Publicado: (2026)

Plane Strong Connectivity Augmentation
por: Bessy, Stéphane, et al.
Publicado: (2025)

Flipping Non-Crossing Spanning Trees
por: Bjerkevik, Håvard Bakke, et al.
Publicado: (2024)

Euclidean Maximum Matchings in the Plane---Local to Global
por: Biniaz, Ahmad, et al.
Publicado: (2024)

Automated Mathematical Discovery and Verification: Minimizing Pentagons in the Plane
por: Subercaseaux, Bernardo, et al.
Publicado: (2023)

Flip Paths Between Lattice Triangulations
por: Sims, William, et al.
Publicado: (2020)

Counting of Shortest Paths in Cubic Grid
por: Dutt, Mousumi, et al.
Publicado: (2018)

Plane Hamiltonian Cycles in Convex Drawings
por: Bergold, Helena, et al.
Publicado: (2024)

Reconfiguration Algorithms for Cubic Modular Robots with Realistic Movement Constraints
por: NASA Space Robots Team, et al.
Publicado: (2024)

Untangling Segments in the Plane
por: da Fonseca, Guilherme D., et al.
Publicado: (2025)

On RAC Drawings of Graphs with Two Bends per Edge
por: Tóth, Csaba D.
Publicado: (2023)

Efficient search of a minimum tree on points in a space with the $l_1$-norm
por: Kaymakov, K. V., et al.
Publicado: (2024)

Stable Homology-Based Cycle Centrality Measures
por: Manzanares, John Rick D., et al.
Publicado: (2022)

Sparse Bounded Hop-Spanners for Geometric Intersection Graphs
por: Bhore, Sujoy, et al.
Publicado: (2025)

The Complexity of Intersection Graphs of Lines in Space and Circle Orders
por: Cardinal, Jean
Publicado: (2024)

Bounding the Treewidth of Outer $k$-Planar Graphs via Triangulations
por: Firman, Oksana, et al.
Publicado: (2024)

Disk and Partial Disk Inspection: Worst- to Average-Case and Pareto Upper Bounds
por: Conley, James, et al.
Publicado: (2024)

On maximum-sum matchings of bichromatic points
por: Chacón-Rivera, Oscar, et al.
Publicado: (2024)

The Price of Upwardness
por: Angelini, Patrizio, et al.
Publicado: (2024)

Pathwidth of 2-Layer $k$-Planar Graphs
por: Okada, Yuto
Publicado: (2025)

Drawing Trees and Cacti with Integer Edge Lengths on a Polynomial-Size Grid
por: Förster, Henry, et al.
Publicado: (2025)

Linear Layouts of Graphs with Priority Queues
por: Di Giacomo, Emilio, et al.
Publicado: (2025)

Flipping Matchings is Hard
por: Binucci, Carla, et al.
Publicado: (2025)

Maximum rectilinear convex subsets
por: González-Aguilar, Hernán, et al.
Publicado: (2019)

Automated Symmetric Constructions in Discrete Geometry
por: Subercaseaux, Bernardo, et al.
Publicado: (2025)

Outerplanar and Forest Storyplans
por: Fiala, Jiří, et al.
Publicado: (2023)

Crossing Number is NP-hard for Constant Path-width (and Tree-width)
por: Hliněný, Petr, et al.
Publicado: (2024)

A Couple of Simple Algorithms for $k$-Dispersion
por: Chen, Ke, et al.
Publicado: (2025)

Rainbow polygons for colored point sets in the plane
por: Flores-Peñaloza, David, et al.
Publicado: (2020)

Improved upper bounds for the Heilbronn's Problem for $k$-gons
por: Gajjala, Rishikesh, et al.
Publicado: (2024)

Combinatorics of rectangulations: Old and new bijections
por: Asinowski, Andrei, et al.
Publicado: (2024)

Separable Drawings: Extendability and Crossing-Free Hamiltonian Cycles
por: Aichholzer, Oswin, et al.
Publicado: (2024)

Improved bounds for the bracketing number of orthants or revisiting an algorithm of Thiémard to compute bounds for the star discrepancy
por: Gnewuch, Michael
Publicado: (2024)

Free Sets in Planar Graphs: History and Applications
por: Dujmović, Vida, et al.
Publicado: (2024)

Pentagon Minimization without Computation
por: Mackey, John, et al.
Publicado: (2024)

Larger Nearly Orthogonal Sets over Finite Fields
por: Haviv, Ishay, et al.
Publicado: (2024)

Coloring problems on arrangements of pseudolines
por: Roch, Sandro
Publicado: (2024)

Intersection Graphs with and without Product Structure
por: Merker, Laura, et al.
Publicado: (2024)