No article text was recorded for this version.
reconfiguration graph connectivity
Version 1 of 127 papers54 conceptsfrozen 2026-10-04
Papers in this version
- Blog: The Hamiltonian Path Graph is Connected for Simple s, t Paths in Rectangular Grid Graphs
- Blog: Flips in Odd Matchings
- Blog: Monotone edge flips to an orientation of maximum edge-connectivity à la Nash-Williams
- Blog: Reconfiguration of labeled matchings in triangular grid graphs
- Blog: On Reconfigurability of Target Sets
- Blog: Independent-Set Reconfiguration Thresholds of Hereditary Graph Classes
- Blog: The hamiltonian path graph is connected for simple s, t paths in rectangular grid graphs
- Blog: Reconfiguring Shortest Paths in Graphs
- Blog: Reconfiguration Using Generalized Token Jumping
- Blog: Disjoint Compatibility Graph of Non-Crossing Matchings of Points in Convex Position
- Blog: Structural and Combinatorial Properties of 2-Swap Word Permutation Graphs
- Blog: On the asymmetric generalizations of two extremal questions on friends-and-strangers graphs
- Blog: Foreword: Special Issue on IPEC 2014
- Blog: On the Construction of the Inclusion Boundary Neighbourhood for Markov Equivalence Classes of Bayesian Network Structures
- Blog: Chaining Test Cases for Reactive System Testing
- Blog: Reasoning about Nondeterministic and Concurrent Actions: A Process Algebra Approach
- Blog: Typical and extremal aspects of friends-and-strangers graphs
- Blog: Reconfiguring Shortest Paths in Graphs
- Blog: Packing Disks by Flipping and Flowing
- Blog: Distributed Parameter Estimation in Probabilistic Graphical Models
- Blog: Preliminary design of future reconfigurable IMA platforms
- Blog: Thermodynamic Tree: The Space of Admissible Paths
- Blog: Optimal PSPACE-hardness of Approximating Set Cover Reconfiguration
- Blog: On Reachable Assignments under Dichotomous Preferences
- Blog: Reconfiguration of Multisets with Applications to Bin Packing
- Blog: Sketching methods with small window guarantee using minimum decycling sets
- Blog: Second Hamiltonian cycles in claw-free graphs
History & citation
Current · Permanent link
Cite this direction
Latest version (a living page):
@misc{lacuna_reconfiguration_graph_connectivity_77de68e1,
title = {reconfiguration graph connectivity},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/reconfiguration-graph-connectivity/rdr_77de68e163d1475983311a9d17c99cbe},
note = {Latest version of a living research direction; cite a version for a fixed text. Accessed 2026-11-20},
}This exact version (version 1, frozen text):
@misc{lacuna_reconfiguration_graph_connectivity_77de68e1_v1,
title = {reconfiguration graph connectivity},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/reconfiguration-graph-connectivity/rdr_77de68e163d1475983311a9d17c99cbe/v/1},
note = {Version 1, frozen 2026-10-04. Accessed 2026-11-20},
}