The following pages link to Matthew Williamson (Q261359):
Displaying 14 items.
- Fast algorithms for the undirected negative cost cycle detection problem (Q261362) (← links)
- Corrigendum to: ``On the negative cost girth problem in planar networks'' (Q350729) (← links)
- On approximating optimal weight ``no''-certificates in weighted difference constraint systems (Q721917) (← links)
- Optimal length tree-like refutations of linear feasibility in UTVPI constraints (Q777309) (← links)
- On the negative cost girth problem in planar networks (Q891820) (← links)
- (Q972359) (redirect page) (← links)
- A faster algorithm for the single source shortest path problem with few distinct positive lengths (Q972360) (← links)
- Improved algorithms for optimal length resolution refutation in difference constraint systems (Q1941901) (← links)
- On finding shortest paths in arc-dependent networks (Q2225067) (← links)
- Polynomial time algorithms for optimal length tree-like refutations of linear infeasibility in UTVPI constraints (Q2235285) (← links)
- A new algorithm for the minimum spanning tree verification problem (Q2340495) (← links)
- A fully polynomial time approximation scheme for refutations in weighted difference constraint systems (Q2636553) (← links)
- On the Shoshan-Zwick Algorithm for the All-Pairs Shortest Path Problem (Q2971390) (← links)
- Arc-dependent networks: theoretical insights and a computational study (Q6588520) (← links)
