Linear time algorithms on mirror trees

DOI10.1007/s10878-022-00900-yzbMath1505.90110OpenAlexW4295008616WikidataQ114225844 ScholiaQ114225844MaRDI QIDQ2091108

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

zbMATH Keywords

linear time complexitylinear orderingdirected sum-cutmirror graphsmirror trees

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Cites Work

• Some new families of graceful graphs
• Optimality of HLF for scheduling divide-and-conquer UET task graphs on identical parallel processors
• Cubic inflation, mirror graphs, regular maps, and partial cubes
• Mirror graphs: graph theoretical characterization of reflection arrangements and finite Coxeter groups
• Memory management optimization problems for integrated circuit simulators
• 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
• The Recognition of Series Parallel Digraphs
• Optimal Linear Ordering
• Efficient algorithms for measuring the funnel-likeness of DAGs
• Unnamed Item
• Unnamed Item

This page was built for publication: Linear time algorithms on mirror trees