The following pages link to Gyula Pap (Q301117):
Displaying 24 items.
- Algorithms for multiplayer multicommodity flow problems (Q301120) (← links)
- (Q463291) (redirect page) (← links)
- An algorithm for weighted fractional matroid matching (Q463292) (← links)
- Tree metrics and edge-disjoint \(S\)-paths (Q463719) (← links)
- Blocking optimal arborescences (Q507342) (← links)
- On the maximum even factor in weakly symmetric graphs (Q598466) (← links)
- Combinatorial algorithms for matchings, even factors and square-free 2-factors (Q877189) (← links)
- Weighted restricted 2-matching (Q1013978) (← links)
- Blocking unions of arborescences (Q1751195) (← links)
- Packing non-returning A-paths (Q2460627) (← links)
- Matchings of cycles and paths in directed graphs (Q2460633) (← links)
- Packing non-returning \(A\)-paths algorithmically (Q2476288) (← links)
- (Q3424789) (← links)
- Packings and 2-packings of A-paths (Q3439371) (← links)
- Some new results on node-capacitated packing of A-paths (Q3549661) (← links)
- (Q3576677) (← links)
- A Combinatorial Algorithm to Find a Maximum Even Factor (Q3596366) (← links)
- (Q3617664) (← links)
- Synchronized Traveling Salesman Problem (Q5084688) (← links)
- Matchings and Nonrainbow Colorings (Q5189521) (← links)
- (Q5306146) (← links)
- Matching Problems in Polymatroids Without Double Circuits (Q5429266) (← links)
- Integer Programming and Combinatorial Optimization (Q5712449) (← links)
- Shortest odd paths in undirected graphs with conservative weight functions (Q6611004) (← links)
