scientific article
From MaRDI portal
Publication:4038720
zbMath0765.68044MaRDI QIDQ4038720
Publication date: 18 May 1993
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Related Items (22)
Maximum matchings in planar graphs via Gaussian elimination ⋮ An extension of Hall's theorem for partitioned bipartite graphs ⋮ Graph factors and factorization: 1985--2003: a survey ⋮ Optimal extension protocols for Byzantine broadcast and agreement ⋮ Graph properties checkable in linear time in the number of vertices ⋮ On the Power of Tree-Depth for Fully Polynomial FPT Algorithms ⋮ Maximum skew-symmetric flows ⋮ (1- ϵ )-Approximate Maximum Weighted Matching in poly(1/ ϵ , log n ) Time in the Distributed and Parallel Settings ⋮ Maximum matching in regular and almost regular graphs ⋮ Linear Time Approximation Algorithms for Degree Constrained Subgraph Problems ⋮ The power of linear-time data reduction for maximum matching ⋮ Processor efficient parallel matching ⋮ A polynomial algorithm to find an independent set of maximum weight in a fork-free graph ⋮ Path factors and parallel knock-out schemes of almost claw-free graphs ⋮ Unnamed Item ⋮ On the anti-Kekulé problem of cubic graphs ⋮ Illumination in the presence of opaque line segments in the plane ⋮ Storage controlled pile-up systems, theoretical foundations ⋮ The Power of Linear-Time Data Reduction for Maximum Matching ⋮ Tractable minor-free generalization of planar zero-field Ising models ⋮ Unnamed Item ⋮ A theory of alternating paths and blossoms for proving correctness of the \(O(\sqrt{V}E)\) general graph maximum matching algorithm
This page was built for publication:
