Algorithms for media

DOI10.1016/J.DAM.2007.05.035MaRDI QIDQ947070zbMATH OpenOpenAlexFDO

Authors 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

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

Recommendations

• Graph Drawing
• scientific article; zbMATH DE number 1735854
• Media theory
• ADVANCES IN MEDIA THEORY
• Media theory: Representations and examples

Cites work

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

Cited in

(6)

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

Describes a project that uses

Uses Software

• Python

This page was built for publication: Algorithms for media

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q947070)