scientific article; zbMATH DE number 7561360

DOI10.4230/LIPIcs.ISAAC.2018.6MaRDI QIDQ5090996

Alexandru Popa, Guillaume Ducoffe

Publication date: 21 July 2022

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

zbMATH Keywords

maximum matching\(P_4\)-structuremodular decompositionone-vertex extensionsFPT in Ppruned graphs

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Related Items (5)

The use of a pruned modular decomposition for \textsc{maximum matching} algorithms on some graph classes ⋮ The \(b\)-\textsc{Matching} problem in distance-hereditary graphs and beyond ⋮ Unnamed Item ⋮ Fully Polynomial FPT Algorithms for Some Classes of Bounded Clique-width Graphs ⋮ Optimal centrality computations within bounded clique-width graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Model counting for CNF formulas of bounded modular treewidth
• A survey of the algorithmic aspects of modular decomposition
• An O(\(n\)) time algorithm for maximum matching on cographs
• Clique-width of graphs defined by one-vertex extensions
• Distance-hereditary graphs
• Tree- and forest-perfect graphs
• Matching and multidimensional matching in chordal and strongly chordal graphs
• Computing maximum stable sets for distance-hereditary graphs
• TWO THEOREMS IN GRAPH THEORY
• Simpler Linear-Time Modular Decomposition Via Recursive Factorizing Permutations
• A Linear Recognition Algorithm for Cographs
• Paths, Trees, and Flowers
• Transitiv orientierbare Graphen
• An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
• A simple paradigm for graph recognition: Application to cographs and distance hereditary graphs

This page was built for publication: