Algorithms for media
From MaRDI portal
Publication:947070
DOI10.1016/J.DAM.2007.05.035zbMATH Open1220.05119OpenAlexW2081275038MaRDI QIDQ947070FDOQ947070
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
Recommendations
Cites Work
- A linear-time algorithm for testing the truth of certain quantified Boolean formulas
- The theory of convex geometries
- Title not available (Why is that?)
- Reverse search for enumeration
- Distance-preserving subgraphs of hypercubes
- Recognizing binary Hamming graphs inO(n 2 logn) time
- Generating all the acyclic orientations of an undirected graph
- Well-graded families of relations
- Reset Sequences for Monotonic Automata
- Knowledge Spaces
- Title not available (Why is that?)
- Greedoids
- On the Length of the Smallest Uniform Experiment which Distinguishes the Terminal States of a Machine
- The lattice dimension of a graph
- The number of unique-sink orientations of the hypercube
- Reset words for commutative and solvable automata
- Title not available (Why is that?)
- Stochastic token theory
- Media theory: Representations and examples
- Generating binary trees of bounded height
- Media theory
- Hyperplane arrangements in preference modeling
- ADVANCES IN MEDIA THEORY
- Graph Drawing
Cited In (6)
- Nearmedia and their representations
- Graph Drawing
- Media theory: Representations and examples
- Stochastic applications of media theory: Random walks on weak orders or partial orders
- Computing kemeny rankings from \(d\)-Euclidean preferences
- On partial cubes, well-graded families and their duals with some applications in graphs
Uses Software
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)
