The following pages link to Networks (Q2719842):
Displaying 50 items.
- Polynomially solvable special cases of the quadratic bottleneck assignment problem (Q411238) (← links)
- Homogeneous sets and domination: A linear time algorithm for distance?hereditary graphs (Q2719843) (← links)
- On the number of spanning trees in directed circulant graphs (Q2719844) (← links)
- The capacitated arc routing problem with intermediate facilities (Q2719845) (← links)
- Multigraph augmentation under biconnectivity and general edge-connectivity requirements (Q2719846) (← links)
- Minimum spanners of butterfly graphs (Q2719847) (← links)
- On the construction of combinedk-fault-tolerant Hamiltonian graphs (Q2719848) (← links)
- A new?old algorithm for minimum-cut and maximum-flow in closure graphs (Q2744651) (← links)
- Balanced network flows. IV. Duality and structure theory (Q2744653) (← links)
- Balanced network flows. V. Cycle-canceling algorithms (Q2744654) (← links)
- Balanced network flows. VI. Polyhedral descriptions (Q2744655) (← links)
- Stability of networks and protocols in the adversarial queueing model for packet routing (Q2744656) (← links)
- Characterization results of all shortest paths interval routing schemes (Q2744657) (← links)
- Characterizing the bit permutation networks obtained from the line digraphs of bit permutation networks (Q2747798) (← links)
- An algorithm for constructing minimalc-broadcast networks (Q2747800) (← links)
- Electronic voting in a large-scale distributed system (Q2747801) (← links)
- The ultracenter and central fringe of a graph (Q2747803) (← links)
- Efficient communication in unknown networks (Q2747804) (← links)
- Local search with perturbations for the prize-collecting Steiner tree problem in graphs (Q2747806) (← links)
- On the traveling salesman problem restricted to inputs satisfying a relaxed triangle inequality (Q2748380) (← links)
- A polynomial algorithm for a constrained traveling salesman problem (Q2748381) (← links)
- A catalog of Hanan grid problems (Q2748382) (← links)
- The center function on trees (Q2748383) (← links)
- Solving the minimum-weighted coloring problem (Q2748384) (← links)
- Robust location problems with pos/neg weights on a tree (Q2748385) (← links)
- Universally maximum flow with piecewise-constant capacities (Q2764994) (← links)
- Worst-case ratios of networks in the rectilinear plane (Q2764995) (← links)
- File distribution in networks with multimedia storage servers (Q2764997) (← links)
- Minimum linear gossip graphs and maximal linear (?,k)-gossip graphs (Q2764998) (← links)
- k-Broadcasting in trees (Q2764999) (← links)
- On the geodetic number of a graph (Q2782725) (← links)
- Minimax inverse problems of minimum cuts (Q2782726) (← links)
- The simplex algorithm for multicommodity networks (Q2782728) (← links)
- A comparative analysis of several formulations for the generalized minimum spanning tree problem (Q2782729) (← links)
- Balanced network flows. VII. Primal-dual algorithms (Q2782730) (← links)
- On multiroute maximum flows in networks (Q2782731) (← links)
- A linear-size zero?one programming model for the minimum spanning tree problem in planar graphs (Q2782732) (← links)
- The price of anarchy in nonatomic consumption-relevance congestion games (Q2811296) (← links)
- Efficient algorithms for a simple network design problem (Q2811297) (← links)
- Computation of the optimal value function in time-dependent networks (Q2811299) (← links)
- Complexity and approximability of the maximum flow problem with minimum quantities (Q2811300) (← links)
- Analysis of an exact algorithm for the vessel speed optimization problem (Q2811302) (← links)
- Faster strongly polynomial algorithms for the unbalanced transportation problem and assignment problem with monge costs (Q2811304) (← links)
- Complexity of a classical flow restoration problem (Q2811305) (← links)
- Single bend paths on a grid have strong helly number 4: <i>errata atque emendationes ad</i> “edge intersection graphs of single bend paths on a grid” (Q2811306) (← links)
- Optimal edge-coloring with edge rate constraints (Q2811307) (← links)
- A survey of resource constrained shortest path problems: Exact solution approaches (Q2811308) (← links)
- Nonoblivious 2-Opt heuristics for the traveling salesman problem (Q2811309) (← links)
- Solutions to conjectures on the (<i>k</i> ,ℓ)-rainbow index of complete graphs (Q2811310) (← links)
- Theoretical and computational advances for network diversion (Q2811311) (← links)
