Linear time algorithms on mirror trees
From MaRDI portal
Publication:2091108
DOI10.1007/S10878-022-00900-YzbMATH Open1505.90110OpenAlexW4295008616WikidataQ114225844 ScholiaQ114225844MaRDI QIDQ2091108FDOQ2091108
Authors: Djamal Rebaine, Alain Quilliot 
Publication date: 31 October 2022
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-022-00900-y
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
- Title not available (Why is that?)
- Cubic inflation, mirror graphs, regular maps, and partial cubes
- The Recognition of Series Parallel Digraphs
- Title not available (Why is that?)
- Some new families of graceful graphs
- Optimal Linear Ordering
- Optimality of HLF for scheduling divide-and-conquer UET task graphs on identical parallel processors
- 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
- Linear time algorithms to solve the linear ordering problem for oriented tree based graphs
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)
