The following pages link to Networks (Q2719842):
Displaying 50 items.
- Polynomially solvable special cases of the quadratic bottleneck assignment problem (Q411238) (← links)
- Cooperative triangulation in MSBNs without revealing subnet structures (Q2709889) (← links)
- How hard is it to determine if a graph has a 2-role assignment? (Q2714905) (← links)
- A branch and cut method for the degree-constrained minimum spanning tree problem (Q2714906) (← links)
- Embedding longest fault-free paths in arrangement graphs with faulty vertices (Q2714908) (← links)
- Improved upper and lower bounds for \(k\)-broadcasting (Q2714909) (← links)
- Scattering number in graphs (Q2714911) (← links)
- Minimizing drop cost for SONET/WDM networks with \(\frac 18\) wavelength requirements (Q2714912) (← 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 combined \(k\)-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 minimal \(c\)-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 \((\Delta,k)\)-gossip graphs (Q2764998) (← links)
- \(k\)-broadcasting in trees (Q2764999) (← links)
- On crossings, the crossing postman problem, and the rural postman problem (Q2766099) (← links)
- The pilot method: a strategy for heuristic repetition with application to the Steiner problem in graphs (Q2766100) (← links)
- Tenacity of complete graph products and grids (Q2766101) (← links)
- On the superconnectivity and the conditional diameter of graphs and digraphs (Q2766102) (← links)
- Optimal adaptive fault diagnosis for simple multiprocessor systems (Q2766104) (← links)
- Crossing properties of multiterminal cuts (Q2766105) (← links)
- Modeling \(k\)-coteries by well-covered graphs (Q2766106) (← links)
- Heuristic and exact algorithms for scheduling aircraft landings (Q2767230) (← 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)
