scientific article; zbMATH DE number 7561564
From MaRDI portal
Publication:5091230
DOI10.4230/LIPIcs.ICALP.2019.71MaRDI QIDQ5091230
Falko Hegerfeld, Stefan Kratsch
Publication date: 21 July 2022
Full work available at URL: https://arxiv.org/abs/1904.11244
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (2)
Data Reduction for Maximum Matching on Real-World Graphs ⋮ Maximum matching in almost linear time on graphs of bounded clique-width
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An \(O(n)\) time algorithm for maximum matching in \(P_{4}\)-tidy graphs
- On compressing permutations and adaptive sorting
- Sparsity. Graphs, structures, and algorithms
- An O(\(n\)) time algorithm for maximum matching on cographs
- Finding a maximum matching in a circular-arc graph
- Matching and multidimensional matching in chordal and strongly chordal graphs
- LRM-trees: compressed indices, adaptive sorting, and compressed permutations
- Maximum skew-symmetric flows and matchings
- A linear time algorithm for maximum matchings in convex, bipartite graphs
- Maximum matching in regular and almost regular graphs
- Polynomial fixed-parameter algorithms: a case study for longest path on interval graphs
- Approximation and tidying -- a problem kernel for \(s\)-plex cluster vertex deletion
- Matching algorithms are fast in sparse random graphs
- Matching Triangles and Basing Hardness on an Extremely Popular Conjecture
- TWO THEOREMS IN GRAPH THEORY
- On the Power of Tree-Depth for Fully Polynomial FPT Algorithms
- A More Relaxed Model for Graph-Based Data Clustering: s-Plex Editing
- A graph‐theoretic generalization of the clique concept
- Faster scaling algorithms for general graph matching problems
- Fully Polynomial-Time Parameterized Computations for Graphs and Matrices of Low Treewidth
- A Linear-Time Algorithm for Maximum-Cardinality Matching on Cocomparability Graphs
- Approximation and Fixed Parameter Subquadratic Algorithms for Radius and Diameter in Sparse Graphs
- Computing Graph Distances Parameterized by Treewidth and Diameter
- Robust and Adaptive Search
- Efficient and Adaptive Parameterized Algorithms on Modular Decompositions
- The Power of Linear-Time Data Reduction for Maximum Matching
- BIPARTITE GRAPHS TOTALLY DECOMPOSABLE BY CANONICAL DECOMPOSITION
- Paths, Trees, and Flowers
- Maximum matching in a convex bipartite graph
- An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
- Parameterized aspects of triangle enumeration
- When can graph hyperbolicity be computed in linear time?
This page was built for publication:
