Short Encodings of Evolving Structures
From MaRDI portal
Automata and formal grammars in connection with logical questions (03D05) Planar graphs; geometric and topological aspects of graph theory (05C10) Eulerian and Hamiltonian graphs (05C45) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Applications of graph theory (05C90) Analysis of algorithms and problem complexity (68Q25) Grammars and rewriting systems (68Q42) Graph theory (including graph drawing) in computer science (68R10)
Recommendations
Cited in
(16)- Geometry of the space of phylogenetic trees
- Flipping edge-labelled triangulations
- Bounds for phylogenetic network space metrics
- The diameter of the thick part of moduli space and simultaneous Whitehead moves
- Computing the flip distance between triangulations
- Packing disks by flipping and flowing
- On bounds for the rotation distance between binary coupling trees
- Uniform growth rate
- Two shortest path metrics on well-formed parentheses strings
- scientific article; zbMATH DE number 3916077 (Why is no real title available?)
- Average-case analysis via incompressibility
- The geometry of flip graphs and mapping class groups
- Some notes on the nearest neighbour interchange distance
- Growth of the Weil-Petersson diameter of moduli space
- Flips in planar graphs
- The combinatorics of discrete time-trees: theory and open problems
This page was built for publication: Short Encodings of Evolving Structures
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4018854)