skip to main content
Department of Computer Science University of Colorado Boulder
cu: home | engineering | mycuinfo | about | cu a-z | search cu | contact cu cs: about | calendar | directory | catalog | schedules | mobile | contact cs
home | quick links | site map | who's where | cs a-z
people events courses undergraduate graduate research department site
home · the department · publications · technical reports · 
 

Technical Reports by Harold (Hal) Gabow
 
by Author by Year by Number All Reports
<
A B C D E F G H I J K L M N O P Q R S T U V W X Y Z
>
CU-CS-053-74
Decomposing Symmetric Exchanges in Matroid Bases
CU-CS-056-74
Using Blossoms to Find Maximum Matchings on Graphs
CU-CS-062-75
An Efficient Implementation of Edmonds' Algorithm for Maximum Matching on Graphs
CU-CS-075-75
An Efficient Implementation of Edmonds' Algorithm for Maximum Weight Matching on Graphs
CU-CS-078-75
Two Algorithms for Generating Weighted Spanning Trees in Order
CU-CS-081-75
On Two Problems in the Generation of Program Test Paths
CU-CS-082-75
Using Euler Partitions to Edge Color Bipartite Multigraphs
CU-CS-083-75
A Note on Degree-Constrained Star Subgraphs of Bipartite Graphs
CU-CS-086-76
Improved Bounds on the Number of 1-Factors on n-Connected Perfect Graphs
CU-CS-094-76
Algorithmic Proofs of Two Relations Between Connectivity and the 1-Factors of a Graph
CU-CS-103-77
Finding All Spanning Trees of Undirected and Directed Graphs
CU-CS-105-77
A Good Algorithm for Minimum Spanning Trees with a Degree Constraint
CU-CS-107-77
A Counting Approach to Lower Bounds for Selection Problems
CU-CS-123-78
Algorithms for Edge Coloring Bipartite Graphs
CU-CS-124-78
An Improved Method for Finding the K Smallest Cost Assignments in Order
CU-CS-139-78
Finding the Best Solutions: The Cost of ls C Problem and Finding Matchings
CU-CS-169-80
An Almost-Linear Algorithm for Two Processor Scheduling
CU-CS-180-80
A Linear-Time Recognition Algorithm for Interval Dags
CU-CS-196-80
An Almost-Linear Algorithm for Two-Processor Scheduling
CU-CS-212-81
An Almost-Linear Algorithm for two-Processor Scheduling
CU-CS-214-82
Efficient Algorithms for a Family of Matroid Intersection Problems
CU-CS-225-82
Exact and Approximate Algorithms for Scheduling UET Systems on Two Uniform Processors
CU-CS-239-82
Two Lower Bounds on Chomsky Normal Form
CU-CS-252-83
Efficient Reduction Technique for Degree-Constrained Subgraph and Bidirected Network Flow Problems
CU-CS-261-82
A Linear-Time Algorithm for a Special Case of Disjoint Set Union
CU-CS-266-84
Scaling Algorithms for Network Problems
CU-CS-391-88
Almost-Optimum Speed-Ups of Algorithms for Bipartite Matching and Related Problems
CU-CS-424-89
Efficient Theoretic and Practical Algorithms for Linear Matrod Intersection Problems
CU-CS-425-89
Almost-Optimum Parallel Speed-Ups of Algorithms for Bipartite Matching and Related Problems
CU-CS-432-89
Faster Scaling Algorithms for General Graph Matching Problems
CU-CS-446-89
Forests, Frames and Games: Algorithms for Matroid Sums and Applications
CU-CS-468-90
Efficient Algorithms for Independent Assignment on Graphic Matroids
CU-CS-478-90
Data Structures for Weighted Matching and Nearest Common Ancestors with Linking
CU-CS-539-91
A Matroid Approach to Finding Edge Connectivity and Packing Arborescences
CU-CS-545-91
Applications of a Poset Representation to Edge Connectivity and Graph Rigidity
CU-CS-660-93
Centroids, Representations and Submodular Flows
CU-CS-661-93
A Framework for Cost-Scaling Algorithms for Submodular Flow Problems
CU-CS-736-94
Algorithms for Graphic Polymatroids and Parametric s-Sets
CU-CS-773-95
Packing Algorithms for Arborescences (and Spanning Trees) in Capacitated Graphs
CU-CS-790-95
Perfect Arborescence Packing in Preflow Minicut Graphs
CU-CS-889-99
Incrementing Bipartite Digraph Edge-Connectivity
CU-CS-890-99
Path-Based Depth-First Search for Strong and Biconnected Components
CU-CS-908-00
Using Expander Graphs to Find Vertex Connectivity
CU-CS-928-02
The Dynamic Vertex Minimum Problem and Its Application to Clustering-Type Approximation Algorithms
CU-CS-958-03
Choosing a Set of Partitions to Collect in a Connectivity-Based Garbage Collector
CU-CS-991-05
On the L∞-Norm of Extreme Points for Crossing Supermodular Directed Network LPs
  
See also:
Department of Computer Science
College of Engineering and Applied Science
University of Colorado Boulder
Boulder, CO 80309-0430 USA 		Questions/Comments?
Send email to

 Engineering Center Office Tower
ECOT 717
+1-303-492-7514
FAX +1-303-492-2844
XHTML 1.0/CSS2 ©2012 Regents of the University of Colorado
Privacy · Legal · Trademarks 		May 5, 2012 (13:54)
 
.