The following pages link to (Q3477977):
Displaying 23 items.
- Solving multi-metric network problems: an interplay between idempotent semiring rules (Q550649) (← links)
- A preference-based approach to spanning trees and shortest paths problems (Q704097) (← links)
- A differential semantics for jointree algorithms (Q814601) (← links)
- Graph path minimization problem (Q923100) (← links)
- Paths and circuits in g-graphs (Q940975) (← links)
- Path hitting in acyclic graphs (Q1018049) (← links)
- On the implementation of automatic differentiation tools (Q1029809) (← links)
- Distance-related invariants on polygraphs (Q1377616) (← links)
- Fast and efficient solution of path algebra problems (Q1824392) (← links)
- Selecting preferred solutions in the minimax approach to dynamic programming problems under flexible constraints (Q1885750) (← links)
- Avoidable paths in graphs (Q2215468) (← links)
- Fast distance multiplication of unit-Monge matrices (Q2350900) (← links)
- Table design in dynamic programming (Q2509355) (← links)
- Security and trust for wireless autonomic networks. Systems and control methods (Q2512096) (← links)
- Path problems in networks (Q2841524) (← links)
- Path Problems in Complex Networks (Q2913787) (← links)
- (Q3148302) (← links)
- An algebraic framework for multi-objective and robust variants of path problems (Q3297414) (← links)
- Path Problems in Structured Graphs (Q3745869) (← links)
- (Q4262692) (← links)
- (Q5146740) (← links)
- (Q5749311) (← links)
- (Q6083354) (← links)