scientific article; zbMATH DE number 7053363
From MaRDI portal
Publication:5743486
zbMath1425.05150MaRDI QIDQ5743486
Publication date: 10 May 2019
Full work available at URL: https://dl.acm.org/citation.cfm?id=2095227
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Analysis of algorithms (68W40) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items
Fair matchings and related problems, Data locality and replica aware virtual cluster embeddings, A note on block-and-bridge preserving maximum common subgraph algorithms for outerplanar graphs, A simple reduction from maximum weight matching to maximum cardinality matching, EmbAssi: embedding assignment costs for similarity search in large graph databases, Unnamed Item
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Matrix multiplication via arithmetic progressions
- Looking for the order of a system of arbitrary ordinary differential equations. Translated from the Latin manuscript by François Ollivier. Edited by S. Cohn and C. W. Borchardt.
- New scaling algorithms for the assignment and minimum mean cycle problems
- Clique partitions, graph compression and speeding-up algorithms
- Algorithms for dense graphs and networks on the random access computer
- A decomposition theorem for partially ordered sets
- A Decomposition Theorem for Maximum Weight Bipartite Matchings
- Algorithms for the Assignment and Transportation Problems
- Equivalence between priority queues and sorting
- Algebraic Algorithms for Matching and Matroid Problems
- Weighted Bipartite Matching in Matrix Multiplication Time
- An $O(EV\log V)$ Algorithm for Finding a Maximal Weighted Matching in General Graphs
- Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
- An Efficient Implementation of Edmonds' Algorithm for Maximum Matching on Graphs
- Efficient Algorithms for Shortest Paths in Sparse Networks
- Faster scaling algorithms for general graph matching problems
- Faster Scaling Algorithms for Network Problems
- Scaling Algorithms for the Shortest Paths Problem
- Fibonacci heaps and their uses in improved network optimization algorithms
- Paths, Trees, and Flowers
- Algorithms – ESA 2004
- On some techniques useful for solution of transportation network problems
- An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
- Integer priority queues with decrease key in constant time and the single source shortest paths problem
