Recommendations
- Linear time algorithms to solve the linear ordering problem for oriented tree based graphs
- scientific article; zbMATH DE number 3885345
- On optimal linear arrangements of trees
- Mirror graphs: graph theoretical characterization of reflection arrangements and finite Coxeter groups
- scientific article; zbMATH DE number 1670677
Cites work
- scientific article; zbMATH DE number 3690676 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- Cubic inflation, mirror graphs, regular maps, and partial cubes
- Linear time algorithms to solve the linear ordering problem for oriented tree based graphs
- Memory management optimization problems for integrated circuit simulators
- Mirror graphs: graph theoretical characterization of reflection arrangements and finite Coxeter groups
- Non split hop domination number for some mirror graphs and Cartesian product of two distinct paths
- Optimal Linear Ordering
- Optimality of HLF for scheduling divide-and-conquer UET task graphs on identical parallel processors
- Some new families of graceful graphs
- The Recognition of Series Parallel Digraphs
Cited in
(2)
This page was built for publication: Linear time algorithms on mirror trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2091108)
