Algorithms for Media
David Eppstein, Jean-Claude Falmagne
Abstract
Falmagne recently introduced the concept of a medium, a combinatorial object encompassing hyperplane arrangements, topological orderings, acyclic orientations, and many other familiar structures. We find efficient solutions for several algorithmic problems on media: finding short reset sequences, shortest paths, testing whether a medium has a closed orientation, and listing the states of a medium given a black-box description.
Create a lesson
Related papers
Constructive Arboricity in Almost-Linear Time for Dense Graphs
Iman Gholami, Mohammad T. Hajiaghayi, Mahdi JafariRaviz et al.
Tight asymptotic competitive ratio for the Canadian Traveller Problem on unit-weighted grids
Pierre Bergé, Vsevolod Chernyshev, Malory Marin et al.
Breaking Two Barriers for Dynamic Planar Reachability
Adam Karczmarz, Michał Włodarczyk
Deterministic Girth Approximation in Weighted Undirected Graphs
Avi Kadria
Polynomial directed treewidth forces a large bramble with congestion two
Victor A. Campos, Raul Lopes, Rodrigo Nogueira et al.
Minimizing fuzzy Kripke models over residuated lattices
Linh Anh Nguyen