Evaluating topological ordering in directed acyclic graphs

DOI10.5614/ejgta.2021.9.2.25zbMath1481.05060OpenAlexW3188607607MaRDI QIDQ5061711

Damir Vukičević, Suzana Antunović

Publication date: 14 March 2022

Published in: Electronic Journal of Graph Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.5614/ejgta.2021.9.2.25

zbMATH Keywords

measuredirected acyclic graphextremal valuestopological order

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Distance in graphs (05C12) Applications of graph theory to circuits and networks (94C15) Directed graphs (digraphs), tournaments (05C20)

Cites Work

• Unnamed Item
• Unnamed Item
• Random graph orders
• First order properties of random posets
• A branch and bound algorithm for the job-shop scheduling problem
• A study of the cyclic scheduling problem on parallel processors
• Controlled generation of hard and easy Bayesian networks: Impact on maximal clique size in tree clustering
• The linear ordering problem with cumulative costs
• Project scheduling problem with stochastic activity duration times
• Linear time algorithms to solve the linear ordering problem for oriented tree based graphs
• On the Maximal Number of Strongly Independent Vertices in a Random Acyclic Directed Graph
• The Structure of Random Graph Orders

This page was built for publication: Evaluating topological ordering in directed acyclic graphs