Prefix graphs and their applications
From MaRDI portal
Recommendations
- Preface: Graph theory and combinatorics
- On Certain Graph Theory Applications
- An internal presentation of regular graphs by prefix-recognizable graphs
- Expander graphs and their applications
- Preface to the special issue on graph searching: theory and applications
- Preface to special issue on theory and applications of graph searching
- On some graph operations and related applications
- Graph theory with applications
- scientific article; zbMATH DE number 1498519
- Digraphs. Theory, algorithms and applications
Cites work
- scientific article; zbMATH DE number 4131653 (Why is no real title available?)
- scientific article; zbMATH DE number 3852437 (Why is no real title available?)
- On parallel integer merging
- Parallel linear programming in fixed dimension almost surely in constant time
- Parallel Prefix Computation
- Parallelism in Comparison Problems
- Probabilistic construction of deterministic algorithms: approximating packing integer programs
- Randomized range-maxima in nearly-constant parallel time
- Recursive Star-Tree Parallel Data Structure
- The log-star revolution
- The Parallel Simplicity of Compaction and Chaining
- Unbounded fan-in circuits and associative functions
Cited in
(2)
This page was built for publication: Prefix graphs and their applications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6184370)