Simpler Linear-Time Modular Decomposition Via Recursive Factorizing Permutations
From MaRDI portal
Recommendations
Cited in
(91)- On the Grundy number of graphs with few P₄'s
- Minimal separators in extended \(P_4\)-laden graphs
- On the harmless set problem parameterized by treewidth
- Graph searches and their end vertices
- From modular decomposition trees to level-1 networks: pseudo-cographs, polar-cats and prime polar-cats
- Neighborhood covering and independence on P₄-tidy graphs and tree-cographs
- The small set vertex expansion problem
- Refined notions of parameterized enumeration kernels with applications to matching cut enumeration
- Recognizing well covered graphs of families with special \(P _{4}\)-components
- 4-coloring \((P_6, \text{bull})\)-free graphs
- Counting spanning trees using modular decomposition
- The use of a pruned modular decomposition for \textsc{maximum matching} algorithms on some graph classes
- A general algorithmic scheme for combinatorial decompositions with application to modular decompositions of hypergraphs
- Computing densest \(k\)-subgraph with structural parameters
- Efficient and practical algorithms for sequential modular decomposition
- Recognizing k-equistable graphs in FPT time
- Unifying the representation of symmetric crossing families and weakly partitive families
- On the hull number of some graph classes
- Metric dimension of bounded width graphs
- Parameterized algorithms for the independent set problem in some hereditary graph classes
- Cluster editing: kernelization based on edge cuts
- Erdös-Pósa Property of Obstructions to Interval Graphs
- Parameterized algorithms for the module motif problem
- A polynomial kernel for \textsc{Feedback Arc Set} on bipartite tournaments
- Tree-representation of set families and applications to combinatorial decompositions
- Polynomial-time recognition of clique-width 3 graphs
- scientific article; zbMATH DE number 1741000 (Why is no real title available?)
- A fully dynamic algorithm for the recognition of P₄-sparse graphs
- Parameterized complexity of the weighted independent set problem beyond graphs of bounded clique number
- A survey of the algorithmic aspects of modular decomposition
- How Bad is the Freedom to Flood-It?
- Algorithms for finding an independent \(\{K_1,K_2\}\)-packing of maximum weight in a graph
- Restricted coloring problems on graphs with few P₄'s
- scientific article; zbMATH DE number 1456953 (Why is no real title available?)
- Solving the weighted k-separator problem in graphs with specific modules
- Fully polynomial FPT algorithms for some classes of bounded clique-width graphs
- Counting weighted independent sets beyond the permanent
- Efficient and Adaptive Parameterized Algorithms on Modular Decompositions
- Iterated Type Partitions
- Target Set Selection in Dense Graph Classes
- The use of a pruned modular decomposition for maximum matching algorithms on some graph classes
- Target set selection in dense graph classes
- Parameterized complexity of fair vertex evaluation problems
- Grundy Distinguishes Treewidth from Pathwidth
- Parameterized complexity of safe set
- Cograph editing: Merging modules is equivalent to editing P₄s
- Metric Dimension of Bounded Tree-length Graphs
- Algorithm Theory - SWAT 2004
- Transitive orientations in bull-reducible Berge graphs
- Parameterized complexity of satisfactory partition problem
- Minimum eccentricity shortest path problem with respect to structural parameters
- Graph square roots of small distance from degree one graphs
- Subgraph isomorphism on graph classes that exclude a substructure
- Parameterized algorithms for the happy set problem
- Minimum eccentricity shortest path problem with respect to structural parameters
- The \(k\)-distinct language: parameterized automata constructions
- Polynomial kernels for 3-leaf power graph modification problems
- On the parameterized complexity of the acyclic matching problem
- Parameterizing path partitions
- Triangle‐free equimatchable graphs
- Efficient parameterized algorithms for computing all-pairs shortest paths
- Erdős–Pósa property of obstructions to interval graphs
- Computing and listing avoidable vertices and paths
- Parameterized complexity for iterated type partitions and modular-width
- The maximum weight \((\{K_1,K_2\},k,l)\)-packing problem in a graph
- Resolving prime modules: the structure of pseudo-cographs and galled-tree explainable graphs
- Computing well-covered vector spaces of graphs using modular decomposition
- Computing and listing avoidable vertices and paths
- On Structural Parameterizations of the Harmless Set Problem
- Tight Algorithms for Connectivity Problems Parameterized by Modular-Treewidth
- Linear time algorithms for NP-hard problems restricted to \textsc{GaTEx} graphs
- Polynomial Turing compressions for some graph problems parameterized by modular-width
- Getting linear time in graphs of bounded neighborhood diversity
- Polynomial cases for the vertex coloring problem
- Globally minimal defensive alliances: a parameterized perspective
- (t, r)-broadcast domination in graphs
- Spanning trees minimizing branching costs
- An exact algorithm for the minimum sum coloring problem on partially decomposable graphs
- Polynomial Turing compressions for some graph problems parameterized by modular-width
- An improved kernelization algorithm for trivially perfect editing
- Parameterized complexity of maximum happy set and densest k-subgraph
- Obstructions to faster diameter computation: asteroidal sets
- Algorithmic meta-theorems for combinatorial reconfiguration revisited
- Parameterized complexity of locally minimal defensive alliances
- Structural parameterization of cluster deletion
- Solving NP-hard problems on \textsc{GaTEx} graphs: linear-time algorithms for perfect orderings, cliques, colorings, and independent sets
- Refined notions of parameterized enumeration kernels with applications to matching cut enumeration
- Structural parameters for dense temporal graphs
- Parameterized complexity of locally minimal defensive alliances
- The balanced satisfactory partition problem
- Solving some NP-complete problems using split decomposition
This page was built for publication: Simpler Linear-Time Modular Decomposition Via Recursive Factorizing Permutations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3521955)
