Generating two-terminal directed acyclic graphs with a given complexity index by constraint logic programming

DOI10.1016/S1567-8326(03)00057-2zbMath1101.68711OpenAlexW1980322379MaRDI QIDQ1764795

Andreas Drexl, Can Akkan, Alf Kimms

Publication date: 22 February 2005

Published in: The Journal of Logic and Algebraic Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s1567-8326(03)00057-2

zbMATH Keywords

AlgorithmsConstraint logic programmingDirected acyclic graphComplexity indexNetwork generator

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Logic programming (68N17)

Related Items

Network decomposition-based benchmark results for the discrete time-cost tradeoff problem, Asymptotic enumeration of compacted binary trees of bounded right height

Uses Software

• CPLEX
• RanGen

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Greedy concepts for network flow problems
• Optimal procedures for the discrete time/cost trade-off problem in project networks
• Alarm placement in systems with fault propagation
• Network decomposition-based benchmark results for the discrete time-cost tradeoff problem
• Resource-constrained project scheduling: Notation, classification, models, and methods
• Rangen: A random network generator for activity-on-the-node networks
• On the computational power of pushdown automata
• Minimum-Aggregate-Concave-Cost Multicommodity Flows in Strong-Series-Parallel Networks
• A Linear-Time Algorithm for Computing K-Terminal Reliability in Series-Parallel Networks
• Optimal Reduction of Two-Terminal Directed Acyclic Graphs
• Measures of the restrictiveness of project networks
• Complexity of the Discrete Time-Cost Tradeoff Problem for Project Networks
• Characterization and Generation of a General Class of Resource-Constrained Project Scheduling Problems
• The exact overall time distribution of a project with uncertain task durations