Minimizing the location length of a directed graph

DOI10.1007/BF01125140zbMath0875.68713OpenAlexW1983671093MaRDI QIDQ1816096

D. I. Valuev

Publication date: 18 December 1996

Published in: Cybernetics and Systems Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01125140

zbMATH Keywords

directed acyclic graphlocation length

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Directed graphs (digraphs), tournaments (05C20)

Cites Work

• Optimal Linear Ordering

This page was built for publication: Minimizing the location length of a directed graph