Topological orderings of weighted directed acyclic graphs
From MaRDI portal
Publication:284347
DOI10.1016/j.ipl.2016.04.007zbMath1358.05132arXiv1310.0516OpenAlexW1831311575MaRDI QIDQ284347
Cory Palmer, Dömötör Pálvölgyi, Dániel Gerbner, Balázs Keszegh
Publication date: 18 May 2016
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1310.0516
Paths and cycles (05C38) Planar graphs; geometric and topological aspects of graph theory (05C10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85) Signed and weighted graphs (05C22)
Related Items (3)
On the complexity of a linear ordering of weighted directed acyclic graphs ⋮ Static Scheduling with Load Balancing for Solving Triangular Band Linear Systems on Multicore Processors ⋮ Optimizing consolidation processes in hubs: the hub-arrival-departure problem
Cites Work
This page was built for publication: Topological orderings of weighted directed acyclic graphs
