No label defined (Q5002673)

From MaRDI portal

Jump to:navigation, search

scientific article; zbMATH DE number 7375934

Language	Label	Description	Also known as
English	No label defined	scientific article; zbMATH DE number 7375934

Statements

scholarly article

0 references

0 references

0 references

0 references

0 references

0 references

publication date

28 July 2021

0 references

full work available at URL

https://arxiv.org/abs/1711.06625

0 references

zbMATH Keywords

dynamic matching

0 references

worst-case update time

0 references

maximum matching

0 references

maximum-weight matching

0 references

MaRDI profile type

MaRDI publication profile

0 references

On Dynamic Approximate Shortest Paths for Planar Graphs with Worst-Case Costs

0 references

Fully dynamic all-pairs shortest paths with worst-case update-time revisited

0 references

0 references

Incremental algorithms for minimal length paths

0 references

Fully Dynamic Maximal Matching in O (log n) Update Time

0 references

Fully Dynamic Maximal Matching in $O(\log n)$ Update Time

0 references

Improved decremental algorithms for maintaining transitive closure and all-pairs shortest paths

0 references

Fully Dynamic Matching in Bipartite Graphs

0 references

Faster Fully Dynamic Matchings with Small Approximation Ratios

0 references

Deterministic Fully Dynamic Data Structures for Vertex Cover and Matching

0 references

New deterministic approximation algorithms for fully dynamic matching

0 references

Fully Dynamic Approximate Maximum Matching and Minimum Vertex Cover in <i>O</i>(log<sup>3</sup> <i>n</i>) Worst Case Update Time

0 references

Negative-Weight Shortest Paths and Unit Capacity Minimum Cost Flow in Õ (<i>m</i><sup>10/7</sup> log <i>W</i>) Time (Extended Abstract)

0 references

0 references

A new approach to dynamic all pairs shortest paths

0 references

Fully dynamic all pairs shortest paths with real edge weights

0 references

Linear-Time Approximation for Maximum Weight Matching

0 references

Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems

0 references

Fibonacci heaps and their uses in improved network optimization algorithms

0 references

0 references

Faster Scaling Algorithms for Network Problems

0 references

Sublinear-time decremental algorithms for single-source reachability and shortest paths on directed graphs

0 references

A Subquadratic-Time Algorithm for Decremental Single-Source Shortest Paths

0 references

Improved Algorithms for Decremental Single-Source Reachability on Directed Graphs

0 references

Maintaining Minimum Spanning Forests in Dynamic Graphs

0 references

Higher Lower Bounds from the 3SUM Conjecture

0 references

Simple Deterministic Algorithms for Fully Dynamic Maximal Matching

0 references

Maintaining a large matching and a small vertex cover

0 references

Dynamic (1 + ∊)-Approximate Matchings: A Density-Sensitive Approach

0 references

A simple reduction from maximum weight matching to maximum cardinality matching

0 references

0 references

Maximum weight bipartite matching in matrix multiplication time

0 references

0 references

Algorithm Theory - SWAT 2004

0 references

Worst-case update times for fully-dynamic all-pairs shortest paths

0 references

Multiplying matrices faster than coppersmith-winograd

0 references

Identifiers

zbMATH Open document ID

0 references

10.4230/LIPIcs.ICALP.2018.7

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

zbMATH DE Number

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:5002673

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q5002673&oldid=36702449"