2 papers
cs.AI2024
Approximately Optimal Search on a Higher-dimensional Sliding Puzzle
Nono SC Merleau, Miguel O'Malley, Érika Roldán +1
Higher-dimensional sliding puzzles are constructed on the vertices of a -dimensional hypercube, where vertices are distinctly coloured. Rings with the same colours are i…
math.CO2024
Higher Order Bipartiteness vs Bi-Partitioning in Simplicial Complexes
Marzieh Eidi, Sayan Mukherjee
Bipartite graphs are a fundamental concept in graph theory with diverse applications. A graph is bipartite iff it contains no odd cycles, a characteristic that has many implication…