Pages that link to "Item:Q1844853"
From MaRDI portal
The following pages link to Graph puzzles, homotopy, and the alternating group (Q1844853):
Displaying 50 items.
- Best subset selection via a modern optimization lens (Q282479) (← links)
- Colored pebble motion on graphs (Q412280) (← links)
- The kissing problem: how to end a gathering when everyone kisses everyone else goodbye (Q489765) (← links)
- Feasibility of motion planning on acyclic and strongly connected directed graphs (Q708329) (← links)
- Complexity of token swapping and its variants (Q722547) (← links)
- When do stepwise algorithms meet subset selection criteria? (Q995431) (← links)
- The direct power of a 1-graph (Q1156141) (← links)
- Sliding piece puzzles with oriented tiles (Q1377741) (← links)
- Bayesian model averaging: A tutorial. (with comments and a rejoinder). (Q1431179) (← links)
- Time-expanded graph-based propositional encodings for makespan-optimal solving of cooperative path finding problems (Q1688718) (← links)
- Model uncertainty (Q1766316) (← links)
- Optimal pebble motion on a tree (Q1854411) (← links)
- Multi-color pebble motion on graphs (Q1957647) (← links)
- Configuration spaces of squares in a rectangle (Q1983546) (← links)
- Pebble exchange group of graphs (Q2033933) (← links)
- Typical and extremal aspects of friends-and-strangers graphs (Q2099406) (← links)
- On simulation in automata networks (Q2106612) (← links)
- Connectivity of friends-and-strangers graphs on random pairs (Q2111926) (← links)
- On the asymmetric generalizations of two extremal questions on friends-and-strangers graphs (Q2143395) (← links)
- On the state liveness of some classes of guidepath-based transport systems and its computational complexity (Q2173958) (← links)
- Cyclic shift problems on graphs (Q2232257) (← links)
- Sliding puzzles and rotating puzzles on graphs (Q2275361) (← links)
- Efficient generation of performance bounds for a class of traffic scheduling problems (Q2286334) (← links)
- Structural aspects of semigroups based on digraphs (Q2328130) (← links)
- Introduction to reconfiguration (Q2331456) (← links)
- Pebble exchange on graphs (Q2341759) (← links)
- Subdimensional expansion for multirobot path planning (Q2343828) (← links)
- Heuristics as Markov chains (Q2350029) (← links)
- A characterization of biconnected graphs reachable by robots jumping over \(m\) obstacles (Q2413355) (← links)
- Motion planning in Cartesian product graphs (Q2450121) (← links)
- Polynomial-time optimal liveness enforcement for guidepath-based transport systems (Q2665316) (← links)
- Friends and strangers walking on graphs (Q2680899) (← links)
- On reachability in graphs with obstacles (Q2788738) (← links)
- Colored Pebble Motion on Graphs (Extended Abstract) (Q2851461) (← links)
- Sequentially Swapping Colored Tokens on Graphs (Q2980931) (← links)
- Finding the Shortest Move-Sequence in the Graph-Generalized 15-Puzzle Is NP-Hard (Q3088169) (← links)
- The maximal subgroups and the complexity of the flow semigroup of finite (di)graphs (Q4596405) (← links)
- Sequentially Swapping Colored Tokens on Graphs (Q4622769) (← links)
- Friends and strangers walking on graphs (Q5048443) (← links)
- Motions of a connected subgraph representing a swarm of robots inside a graph of work stations (Q5054048) (← links)
- A linear time algorithm for the feasibility of pebble motion on trees (Q5054818) (← links)
- (Q5115797) (← links)
- Coordinated Motion Planning: Reconfiguring a Swarm of Labeled Robots with Bounded Stretch (Q5203793) (← links)
- Fast Sequential and Parallel Vertex Relabelings of <i>K<sub>m,m</sub></i> (Q5250275) (← links)
- Multi-agent Pathfinding with n Agents on Graphs with n Vertices: Combinatorial Classification and Tight Algorithmic Bounds (Q5283371) (← links)
- Connectedness of friends-and-strangers graphs of complete bipartite graphs and others (Q6041578) (← links)
- The connectedness of the friends-and-strangers graph of a lollipop and others (Q6045137) (← links)
- Token Swapping on Trees (Q6045462) (← links)
- The 5-puzzle doubly covers the soccer ball (Q6090068) (← links)
- Reconfiguration of connected graph partitions (Q6093138) (← links)
