Linear time algorithms to solve the linear ordering problem for oriented tree based graphs

DOI10.1051/RO/2015024zbMATH Open1338.90254OpenAlexW2308641315MaRDI QIDQ2805488FDOQ2805488

Alain Quilliot, Djamal Rebaine

Publication date: 11 May 2016

Published in: RAIRO. Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1051/ro/2015024

zbMATH Keywords

linear time algorithmsdirected treelinear orderingdivide-and-conquer graphs

Mathematics Subject Classification ID

Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08)

Cites Work

• Title not available (Why is that?)
• Simple linear time recognition of unit interval graphs
• The Recognition of Series Parallel Digraphs
• Optimal Linear Ordering
• An updated survey on the linear ordering problem for weighted or unweighted tournaments
• On optimal linear arrangements of trees
• Optimal Linear Arrangement of Interval Graphs
• Optimality of HLF for scheduling divide-and-conquer UET task graphs on identical parallel processors
• A polynomial algorithm for minDSC on a subclass of series Parallel graphs

Cited In (2)

• Evaluating topological ordering in directed acyclic graphs
• Linear time algorithms on mirror trees

This page was built for publication: Linear time algorithms to solve the linear ordering problem for oriented tree based graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2805488)