- A RANDOMIZED TIMEWORK OPTIMAL PARALLEL ALGORITHM FOR FINDING A MINIMUM SPANNING FOREST #
- Sensitivity Analysis of Minimum Spanning Trees in Sub-Inverse-Ackermann Time
- Fast Algorithms for (max, min)-Matrix Multiplication and Bottleneck Shortest Paths
- Degrees of Nonlinearity in Forbidden 0-1 Matrix Problems Seth Pettie
- On Nonlinear Forbidden 0-1 Matrices: A Refutation of a Furedi-Hajnal Conjecture
- Bounded-Leg Distance and Reachability Oracles The University of Michigan
- An InverseAckermann Style Lower Bound for the Online Minimum Spanning Tree Verification Problem
- The Dynamic Vertex Minimum Problem and Its Application to Clusteringtype Approximation Algorithms
- Microseconds per edge Numberofedges
- The Complexity of Implicit and Space Ecient Priority Queues
- Copyright by SIAM. Unauthorized reproduction of this article is prohibited. SIAM J. DISCRETE MATH. c 2011 Society for Industrial and Applied Mathematics
- Distrib. Comput. DOI 10.1007/s00446-009-0091-7
- Randomized Minimum Spanning Tree Algorithms Using Exponentially Fewer Random Bits
- COMBINATORICA Bolyai Society Springer-Verlag
- Information Processing Letters 91 (2004) 271276 www.elsevier.com/locate/ipl
- An Optimal Minimum Spanning Tree Algorithm SETH PETTIE AND VIJAYA RAMACHANDRAN
- Connectivity Oracles for Failure Prone Graphs University of Michigan
- Dual-Failure Distance and Connectivity Oracles University of Michigan
- Low Distortion Spanners Seth Pettie
- An Inverse-Ackermann Style Lower Bound for the Online Minimum Spanning Tree Verification Problem
- On the Comparison-Addition Complexity of All-Pairs Shortest Paths ?
- On the Structure and Composition of Forbidden Sequences, with Geometric Applications
- SIAM J. COMPUT. c 2005 Society for Industrial and Applied Mathematics Vol. 34, No. 6, pp. 13981431
- Splay Trees, Davenport-Schinzel Sequences, and the Deque Conjecture
- Additive Spanners and (, )-Spanners SURENDER BASWANA
- Low Distortion Spanners SETH PETTIE
- A Near-Linear Constant-Factor Approximation for Euclidean Bipartite Matching?
- Applications of Forbidden 0-1 Matrices to Search Tree and Path Compression-Based Data Structures
- Towards a Final Analysis of Pairing Heaps Seth Pettie
- stratum 1, level 0, NORM = .75 graph vertices
- Journal of Combinatorial Theory, Series A 118 (2011) 18631895 Contents lists available at ScienceDirect
- A RANDOMIZED TIME-WORK OPTIMAL PARALLEL ALGORITHM FOR FINDING A MINIMUM SPANNING FOREST
- A New Approach to All-Pairs Shortest Paths on Real-Weighted Graphs ?
- The Dynamic Vertex Minimum Problem and Its Application to Clustering-type Approximation Algorithms
- Approximating Maximum Weight Matching in Near-linear Time EECS Department
- Balanced Network Flows. VIII. A Revised Theory of Phase-Ordered Algorithms
- Signature Methods for the Assignment Problem Author(s): M. L. Balinski
- Approximating Maximum Weight Matching in Near-linear Time EECS Department
- PSYCHOMETRIKA--VOL, 18, NO. 1 MARCH, 1954
- Mathematical Programming 42 (1988) 203-243 203 North-Holland
- Scaling Algorithms for Approximate and Exact Maximum Weight Matching
- JOURNAL Ok COMPUTER AND SYSTEM S(`1EiX;CF.S 31, 148168 (1985) Scaling Algorithms for Network Problems
- A Fast Algorithm for the Bipartite Node Weighted Matching Problem on Path Graphs
- A Graph-Theoretic Approach to a Class of Integer-Programming Problems Author(s): J. F. Desler and S. L. Hakimi
- Mathematical Programming 21 (1981) 152-171 North-Holland Publishing Company
- Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
- A Primal Method for the Assignment and Transportation Problems Author(s): M. L. Balinski and R. E. Gomory
- A Linear Time Approximation Algorithm for Weighted Matchings in Graphs
- PSYCHOMETRIKA--VOL. 11, NO. 3 SEPTI~MBER,]~4,6
- A New Approach to MaximumMatching in General Graphs Extended Abstract
- SIAM J. COMPUT. Vol. 15, No. 1, February 1986
- Max-product for maximum weight matching: convergence, correctness and LP duality
- Balanced Network Flows. II. Simple Augmentation Algorithms
- lIarold N. Gab& Department of Computer Science
- Balanced Network Flows. V. Cycle-Canceling Algorithms Christian Fremuth-Paeger, Dieter Jungnickel
- Balanced Network Flows. III. Strongly Polynomial Augmentation Algorithms
- Algorithmica (1996) 15:521-549 Algorithmica9 1996Springer-Verlag New York Inc.
- Camp. & h401h.v.withAppls. Vol. 7. pp. 251-2.57, 1981 Printedin Oreat Britain.
- NOTICE CONCERNING COPYRIGHT RESTRICTIONS
- RANDOMIZED O(M(|V |)) ALGORITHMS FOR PROBLEMS IN MATCHING THEORY
- An Out-of-Kilter Method for Minimal-Cost Flow Problems Author(s): D. R. Fulkerson
- MAXIMUM-MINIMUM SATZE UBER GRAPHEN T. GALLAI(Budapest)
- A SIMPLE ALGORITHM FOR FINDING MAXIMAL NETWORK FLOWS AND AN APPLICATION
- Faster Scaling Algorithms for General Graph-Matching Problems
- arXiv:1012.5911v1[cs.DS]29Dec2010 Near approximation of maximum weight matching
- Balanced Network Flows. IV. Duality and Structure Theory
- An Algorithm for the Allocation Problem Author(s): T. E. Easterfield
- May 1992 LIDS -P -2108 Auction Algorithms for Network Flow Problems
- The Direct Solution of the Transportation Problem with Reduced Matrices Author(s): Paul S. Dwyer
- AN EFFICIENT REDUCTION TECHNIQUE FOR DEGREE-CONSTRAINED SUBGRAPH AND BIDIRECTED
- Data Structures for Weighted Matching and Nearest Common Ancestors with Linking
- Fibonacci Heaps and Their Uses in Improved Network Optimization Algorithms
- Balanced Network Flows. VII. Primal-Dual Algorithms Christian Fremuth-Paeger
- ON THE HITCHCOCK DISTRIBUTION PROBLEM MERRILL M. FLOOD
- JOURNAL OF COMRINATORIAL THEORY (B) 13, 1-13 (1972) Establishing the Matching Polytope
- SIAM J. COMPUT. Vol. 18, No. 5, pp. 1013-1036, October 1989
- Improved Linear Time Approximation Algorithms for Weighted Matchings
- Balanced Network Flows. I. A Unifying Framework for Design and Analysis
- The Method of Reduced Matrices for a General Transportation Problem*
- A COMBINATORIAL ALGORITHM. 219 A COMBINATORIAL ALGORITHM*
- Mathematical Programming 5 (1973) 88-124. North-Holland Publishing Company MATCHING, EULER TOURS AND THE CHINESE POSTMAN
- Balanced Network Flows. VI. Polyhedral Descriptions Christian Fremuth-Paeger, Dieter Jungnickel
- An Efficient Implementation of Edmonds' Algorithm for Maximum Matching on Graphs
- TRANSLATING THE METHOD OF REDUCED MATRICES TO MACHINES1 Bernard A. Galler and Paul S. Dwyer
