The following pages link to (Q3048571):
Displaying 50 items.
- The flow circulation sharing problem (Q4745580) (← links)
- The generalized diameter of a graph (Q4747886) (← links)
- The Bounded Path Tree Problem (Q4750668) (← links)
- A comprehensive simplex-like algorithm for network optimization and perturbation analysis (Q4764598) (← links)
- An improved direct labeling method for the max-flow min-cut computation in large hypergraphs and applications (Q4806910) (← links)
- Coloration de graphes : fondements et applications (Q4809665) (← links)
- THE MAXIMUM WEIGHT PERFECT MATCHING PROBLEM FOR COMPLETE WEIGHTED GRAPHS IS IN PC∗† (Q4820105) (← links)
- A spanning tree heuristic for regional clustering (Q4843881) (← links)
- Computing near‐optimal solutions to the steiner problem in a graph using a genetic algorithm (Q4894856) (← links)
- VALUES FOR GAMES ON THE CYCLES OF A DIGRAPH (Q4908590) (← links)
- A branch‐and‐bound algorithm for scheduling of new product development projects (Q4921224) (← links)
- Admissible Representations of Probability Measures (Q4921436) (← links)
- (Q4963196) (← links)
- (Q5000314) (← links)
- A greedy algorithm for dropping digits (Q5020906) (← links)
- Recent developments in maximum flow algorithms (Q5054836) (← links)
- On matroids and hierarchical graphs (Q5056114) (← links)
- Generating sparse 2—spanners (Q5056130) (← links)
- Computing proximity drawings of trees in the 3-dimensional space (Q5057437) (← links)
- Spirality of orthogonal representations and optimal drawings of series-parallel graphs and 3-planar graphs (extended abstract) (Q5060109) (← links)
- Minimum weight euclidean matching and weighted relative neighborhood graphs (Q5060141) (← links)
- On Fault-Tolerant Low-Diameter Clusters in Graphs (Q5060794) (← links)
- A Randomly Weighted Minimum Arborescence with a Random Cost Constraint (Q5085156) (← links)
- (Q5090466) (← links)
- Approximation algorithms for Min-k-overlap problems using the principal lattice of partitions approach (Q5096911) (← links)
- Weighted linear matroid parity (Q5136215) (← links)
- Network Flow-Based Refinement for Multilevel Hypergraph Partitioning (Q5140705) (← links)
- A Weighted Linear Matroid Parity Algorithm (Q5149751) (← links)
- CHAIN STRUCTURES IN SCHEDULES TASKS (Q5150747) (← links)
- MUTUALLY-RECURSIVE FORMULAS FOR ENUMERATING PARTITIONS OF THE RECTANGLE (Q5151296) (← links)
- Counting Perfect Matchings and the Switch Chain (Q5232145) (← links)
- Fully Dynamic Maximal Matching in $O(\log n)$ Update Time (Q5252659) (← links)
- Canceling most helpful total cuts for minimum cost network flow (Q5285477) (← links)
- The most vital edges of matching in a bipartite graph (Q5289375) (← links)
- Admissible representations for probability measures (Q5307610) (← links)
- Design of Survivable Networks: A survey (Q5318274) (← links)
- Shortest Path and Maximum Flow Problems in Networks with Additive Losses and Gains (Q5321689) (← links)
- Toward an Automatic Approach to Greedy Algorithms (Q5321722) (← links)
- The Maximum Ratio Clique Problem: A Continuous Optimization Approach and Some New Results (Q5356986) (← links)
- Maximizing project cash availability (Q5438525) (← links)
- Minimizing the cost of placing and sizing wavelength division multiplexing and optical crossconnect equipment in a telecommunications network (Q5463669) (← links)
- GENERALIZED GEOMETRIC APPROACHES FOR LEAF SEQUENCING PROBLEMS IN RADIATION THERAPY (Q5470171) (← links)
- A bidirected generalization of network matrices (Q5487806) (← links)
- EDIT-DISTANCE OF WEIGHTED AUTOMATA: GENERAL DEFINITIONS AND ALGORITHMS (Q5696947) (← links)
- (Q5743443) (← links)
- Shortest path algorithms using dynamic breadth‐first search (Q5749160) (← links)
- Predicting deadlock in store‐and‐forward networks (Q5750381) (← links)
- Algorithms for Weighted Matching Generalizations II: <i>f</i>-factors and the Special Case of Shortest Paths (Q5858647) (← links)
- Pfaffian Pairs and Parities: Counting on Linear Matroid Intersection and Parity Problems (Q5866449) (← links)
- Fractional programming (Q5896201) (← links)
