scientific article; zbMATH DE number 7561384

DOI10.4230/LIPIcs.ISAAC.2018.30MaRDI QIDQ5091021

Guillaume Ducoffe, Alexandru Popa

Publication date: 21 July 2022

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

distance-hereditary graphs\(b\)-matchingsplit decompositionFPT in Pmaximum-cardinality matching

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Related Items (4)

The \(b\)-\textsc{Matching} problem in distance-hereditary graphs and beyond ⋮ Fully Polynomial FPT Algorithms for Some Classes of Bounded Clique-width Graphs ⋮ Optimal centrality computations within bounded clique-width 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
• Solving some NP-complete problems using split decomposition
• Distance-hereditary graphs
• LexBFS-orderings of distance-hereditary graphs with application to the diametral pair problem
• Polynomial fixed-parameter algorithms: a case study for longest path on interval graphs
• Linear Time Split Decomposition Revisited
• TWO THEOREMS IN GRAPH THEORY
• On the Power of Tree-Depth for Fully Polynomial FPT Algorithms
• Decomposition of Directed Graphs
• Fully polynomial-time parameterized computations for graphs and matrices of low treewidth
• The Power of Linear-Time Data Reduction for Maximum Matching
• ON THE CLIQUE-WIDTH OF SOME PERFECT GRAPH CLASSES
• Paths, Trees, and Flowers
• Fast approximation algorithms for the diameter and radius of sparse graphs
• An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs

This page was built for publication: