Output sensitive fault tolerant maximum matching
type: Item
instance of: scholarly article
title: Output sensitive fault tolerant maximum matching
DOI: 10.1007/978-3-031-09574-0_8
author: Niranka Banerjee
author: Manoj Gupta
author: Venkatesh Raman
author: Saket Saurabh
publication date: 2022-11-11T00:00:00Z
Mathematics Subject Classification ID: 68Qxx
zbMATH DE Number: 7615734
zbMATH Keywords: fault tolerant
zbMATH Keywords: maximum matching
zbMATH Keywords: upper and lower bound
MaRDI profile type: Publication
full work available at URL: 978-3-031-09574-0 8
OpenAlex ID: W4285149523
cites work: Dynamic DFS in Undirected Graphs: breaking the O(m) barrier
cites work: Fault tolerant reachability for directed graphs
cites work: Stochastic matching with few queries: (1-ε) approximation
cites work: Improved Purely Additive Fault-Tolerant Spanners
cites work: Multiple-edge-fault-tolerant approximate shortest-path trees
cites work: Ignorance Is Almost Bliss: Near-Optimal Stochastic Matching with Few Queries
cites work: Fault tolerant additive and \((\mu, \alpha)\)-spanners
cites work: Fault Tolerant Spanners for General Graphs
cites work: Parameterized Algorithms
cites work: Fault-tolerant spanners
cites work: Paths, Trees, and Flowers
cites work: Kernelization
cites work: Faster scaling algorithms for general graph matching problems
cites work: Multiple Source Dual Fault Tolerant BFS Trees
cites work: An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
cites work: Q5743485
cites work: Q3048571
cites work: Matching theory
cites work: Average-case analysis of algorithms for matchings and related problems
cites work: Algorithms – ESA 2004
cites work: Vertex fault tolerant additive spanners
cites work: Dual failure resilient BFS structure
cites work: Sparse Fault-Tolerant BFS Trees
cites work: Fault Tolerant Approximate BFS Structures
cites work: A 4 k 2 kernel for feedback vertex set
cites work: Q4607899
description: scientific article; zbMATH DE number 7615734