Pages that link to "Item:Q1916362"
From MaRDI portal
The following pages link to Deriving a class of layer-oriented graph algorithms (Q1916362):
Displaying 9 items.
- Width-restricted layering of acyclic digraphs with consideration of dummy nodes (Q1603521) (← links)
- Layered graph approaches for combinatorial optimization problems (Q1628112) (← links)
- Combining relation algebra and data refinement to develop rectangle-based functional programs for reflexive-transitive closures (Q2347907) (← links)
- Simple Rectangle-Based Functional Programs for Computing Reflexive-Transitive Closures (Q2915139) (← links)
- An algebraic framework for multi-objective and robust variants of path problems (Q3297414) (← links)
- (Q4522553) (← links)
- Traversing Layered Graphs Using the Work Function Algorithm (Q4881405) (← links)
- A Parametrized Analysis of Algorithms on Hierarchical Graphs (Q5205039) (← links)
- An Efficient Implementation of Sugiyama's Algorithm for Layered Graph Drawing (Q5301374) (← links)