The use of a pruned modular decomposition for \textsc{maximum matching} algorithms on some graph classes (Q2659073): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W3115625065
@@ Property / OpenAlex ID: W3115625065 / rank @@
+Normal rank
@@ Property / cites work @@
+Modular-Width: An Auxiliary Parameter for Parameterized Parallel Complexity
+Normal rank
@@ Property / cites work @@
+Distance-hereditary graphs
@@ Property / cites work: Distance-hereditary graphs / rank @@
+Normal rank
@@ Property / cites work @@
+TWO THEOREMS IN GRAPH THEORY
@@ Property / cites work: TWO THEOREMS IN GRAPH THEORY / rank @@
+Normal rank
@@ Property / cites work @@
+Q5422499
@@ Property / cites work: Q5422499 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5387674
@@ Property / cites work: Q5387674 / rank @@
+Normal rank
@@ Property / cites work @@
+Tree- and forest-perfect graphs
@@ Property / cites work: Tree- and forest-perfect graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q3222224
@@ Property / cites work: Q3222224 / rank @@
+Normal rank
@@ Property / cites work @@
+Computing maximum stable sets for distance-hereditary graphs
+Normal rank
@@ Property / cites work @@
+A Linear Recognition Algorithm for Cographs
@@ Property / cites work: A Linear Recognition Algorithm for Cographs / rank @@
+Normal rank
@@ Property / cites work @@
+Fully Polynomial FPT Algorithms for Some Classes of Bounded Clique-width Graphs
+Normal rank
@@ Property / cites work @@
+Q4954442
@@ Property / cites work: Q4954442 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4232801
@@ Property / cites work: Q4232801 / rank @@
+Normal rank
@@ Property / cites work @@
+Efficient and Practical Algorithms for Sequential Modular Decomposition
+Normal rank
@@ Property / cites work @@
+Matching and multidimensional matching in chordal and strongly chordal graphs
+Normal rank
@@ Property / cites work @@
+A simple paradigm for graph recognition: Application to cographs and distance hereditary graphs
+Normal rank
@@ Property / cites work @@
+Q4373681
@@ Property / cites work: Q4373681 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5090996
@@ Property / cites work: Q5090996 / rank @@
+Normal rank
@@ Property / cites work @@
+Paths, Trees, and Flowers
@@ Property / cites work: Paths, Trees, and Flowers / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithms parameterized by vertex cover and modular width, through potential maximal cliques
+Normal rank
@@ Property / cites work @@
+BIPARTITE GRAPHS TOTALLY DECOMPOSABLE BY CANONICAL DECOMPOSITION
+Normal rank
@@ Property / cites work @@
+An \(O(n)\) time algorithm for maximum matching in \(P_{4}\)-tidy graphs
+Normal rank
@@ Property / cites work @@
+Parameterized Algorithms for Modular-Width
@@ Property / cites work: Parameterized Algorithms for Modular-Width / rank @@
+Normal rank
@@ Property / cites work @@
+Transitiv orientierbare Graphen
@@ Property / cites work: Transitiv orientierbare Graphen / rank @@
+Normal rank
@@ Property / cites work @@
+Maximum matching in a convex bipartite graph
@@ Property / cites work: Maximum matching in a convex bipartite graph / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithm Theory - SWAT 2004
@@ Property / cites work: Algorithm Theory - SWAT 2004 / rank @@
+Normal rank
@@ Property / cites work @@
+Lex-BFS and partition refinement, with applications to transitive orientation, interval graph recognition and consecutive ones testing
+Normal rank
@@ Property / cites work @@
+A survey of the algorithmic aspects of modular decomposition
+Normal rank
@@ Property / cites work @@
+Fast Algorithms for Finding Nearest Common Ancestors
+Normal rank
@@ Property / cites work @@
+An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
+Normal rank
@@ Property / cites work @@
+Q4501560
@@ Property / cites work: Q4501560 / rank @@
+Normal rank
@@ Property / cites work @@
+Finding a maximum matching in a circular-arc graph
+Normal rank
@@ Property / cites work @@
+Q3128916
@@ Property / cites work: Q3128916 / rank @@
+Normal rank
@@ Property / cites work @@
+A Linear-Time Algorithm for Maximum-Cardinality Matching on Cocomparability Graphs
+Normal rank
@@ Property / cites work @@
+Model counting for CNF formulas of bounded modular treewidth
+Normal rank
@@ Property / cites work @@
+Q4871750
@@ Property / cites work: Q4871750 / rank @@
+Normal rank
@@ Property / cites work @@
+Clique-width of graphs defined by one-vertex extensions
+Normal rank
@@ Property / cites work @@
+A semi-strong perfect graph theorem
@@ Property / cites work: A semi-strong perfect graph theorem / rank @@
+Normal rank
@@ Property / cites work @@
+Simpler Linear-Time Modular Decomposition Via Recursive Factorizing Permutations
+Normal rank
@@ Property / cites work @@
+An O(\(n\)) time algorithm for maximum matching on cographs
+Normal rank
@@ Property / cites work @@
+Maximum matching in regular and almost regular graphs
+Normal rank
@@ Property / cites work @@
+Q2934588
@@ Property / cites work: Q2934588 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:2659073