Algorithms for media

DOI10.1016/j.dam.2007.05.035zbMath1220.05119OpenAlexW2081275038MaRDI QIDQ947070

David Eppstein, Jean-Claude Falmagne

Publication date: 29 September 2008

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2007.05.035

zbMATH Keywords

shortest pathsgraph algorithmspartial cubesmedia theoryreset sequences

Mathematics Subject Classification ID

Paths and cycles (05C38) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (4)

On partial cubes, well-graded families and their duals with some applications in graphs ⋮ Computing kemeny rankings from \(d\)-Euclidean preferences ⋮ Stochastic applications of media theory: Random walks on weak orders or partial orders ⋮ Media theory: Representations and examples

Uses Software

• Python

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Generating all the acyclic orientations of an undirected graph
• Greedoids
• Media theory: Representations and examples
• Generating binary trees of bounded height
• The theory of convex geometries
• A linear-time algorithm for testing the truth of certain quantified Boolean formulas
• Well-graded families of relations
• Stochastic token theory
• Reset words for commutative and solvable automata
• Media theory
• The lattice dimension of a graph
• Reverse search for enumeration
• Hyperplane arrangements in preference modeling
• The number of unique-sink orientations of the hypercube
• Distance-preserving subgraphs of hypercubes
• On the Length of the Smallest Uniform Experiment which Distinguishes the Terminal States of a Machine
• ADVANCES IN MEDIA THEORY
• Reset Sequences for Monotonic Automata
• Knowledge Spaces
• Recognizing binary Hamming graphs inO(n 2 logn) time
• Graph Drawing

This page was built for publication: Algorithms for media