Algorithms – ESA 2004

DOI10.1007/b100428zbMath1111.05304OpenAlexW2483610301MaRDI QIDQ5464611

Publication date: 18 August 2005

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/b100428

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85) Randomized algorithms (68W20)

Related Items (49)

Eccentricity, center and radius computations on the cover graphs of distributive lattices with applications to stable matchings ⋮ Fair matchings and related problems ⋮ Minimum cost input/output design for large-scale linear structural systems ⋮ Maximum matchings in planar graphs via Gaussian elimination ⋮ Scheduling the part supply of mixed-model assembly lines in line-integrated supermarkets ⋮ Quantum algorithms for matching problems ⋮ Succinct posets ⋮ Using Relations to Develop a Haskell Program for Computing Maximum Bipartite Matchings ⋮ Multiconsistency and robustness with global constraints ⋮ A Linear-Time Algorithm for Maximum-Cardinality Matching on Cocomparability Graphs ⋮ Maximum 0-1 timed matching on temporal graphs ⋮ On computing an optimal semi-matching ⋮ Alternating paths along axis-parallel segments ⋮ Edge-stable equimatchable graphs ⋮ Polynomial-delay and polynomial-space enumeration of large maximal matchings ⋮ Maximum matchings in geometric intersection graphs ⋮ A Path Cover Technique for LCAs in Dags ⋮ Bipartite matching in the semi-streaming model ⋮ Computing the maximum degree of minors in mixed polynomial matrices via combinatorial relaxation ⋮ Linear Time Approximation Algorithms for Degree Constrained Subgraph Problems ⋮ The power of linear-time data reduction for maximum matching ⋮ Mantaining dynamic matrices for fully dynamic transitive closure ⋮ On finding a large number of 3D points with a small diameter ⋮ Topological Machine Learning with Persistence Indicator Functions ⋮ Restricted and swap common superstring: a multivariate algorithmic perspective ⋮ Minimum many-to-many matchings for computing the distance between two sequences ⋮ Fully Dynamic Maximal Matching in $O(\log n)$ Update Time (Corrected Version) ⋮ Computing the Maximum Degree of Minors in Mixed Polynomial Matrices via Combinatorial Relaxation ⋮ Jump Number of Two-Directional Orthogonal Ray Graphs ⋮ Greedy matching: guarantees and limitations ⋮ Processor efficient parallel matching ⋮ Diverse Pairs of Matchings ⋮ An improved FPT algorithm and a quadratic kernel for pathwidth one vertex deletion ⋮ Unnamed Item ⋮ On conceptually simple algorithms for variants of online bipartite matching ⋮ Independent sets and hitting sets of bicolored rectangular families ⋮ Algebraic Algorithms for Linear Matroid Parity Problems ⋮ Maximum bipartite matchings with low rank data: locality and perturbation analysis ⋮ In-place algorithms for computing a largest clique in geometric intersection graphs ⋮ Going beyond dual execution: MPC for functions with efficient verification ⋮ On Computing an Optimal Semi-matching ⋮ The Power of Linear-Time Data Reduction for Maximum Matching ⋮ Recomputing causality assignments on lumped process models when adding new simplification assumptions ⋮ Fully Dynamic Maximal Matching in $O(\log n)$ Update Time ⋮ Output sensitive fault tolerant maximum matching ⋮ Algorithms for Weighted Matching Generalizations I: Bipartite Graphs, b-matching, and Unweighted f-factors ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item

This page was built for publication: Algorithms – ESA 2004