Pages that link to "Item:Q3521955"
From MaRDI portal
The following pages link to Simpler Linear-Time Modular Decomposition Via Recursive Factorizing Permutations (Q3521955):
Displaying 26 items.
- (Q5092394) (← links)
- Grundy Distinguishes Treewidth from Pathwidth (Q5096586) (← links)
- Parameterized Complexity of Safe Set (Q5119377) (← links)
- Cograph editing: Merging modules is equivalent to editing P_4s (Q5121555) (← links)
- Metric Dimension of Bounded Tree-length Graphs (Q5268001) (← links)
- Algorithm Theory - SWAT 2004 (Q5315370) (← links)
- Parameterized complexity of satisfactory partition problem (Q5918491) (← links)
- Minimum eccentricity shortest path problem with respect to structural parameters (Q5918625) (← links)
- Graph square roots of small distance from degree one graphs (Q5918752) (← links)
- Independent set reconfiguration parameterized by modular-width (Q5918925) (← links)
- Subgraph isomorphism on graph classes that exclude a substructure (Q5919029) (← links)
- Parameterized algorithms for the happy set problem (Q5919103) (← links)
- Minimum eccentricity shortest path problem with respect to structural parameters (Q5925631) (← links)
- The \(k\)-distinct language: parameterized automata constructions (Q5964071) (← links)
- On the parameterized complexity of the acyclic matching problem (Q6038700) (← links)
- Triangle‐free equimatchable graphs (Q6057652) (← links)
- Efficient parameterized algorithms for computing all-pairs shortest paths (Q6069155) (← links)
- Erdős–Pósa property of obstructions to interval graphs (Q6094044) (← links)
- Parameterized complexity for iterated type partitions and modular-width (Q6126724) (← links)
- Resolving prime modules: the structure of pseudo-cographs and galled-tree explainable graphs (Q6180640) (← links)
- Computing well-covered vector spaces of graphs using modular decomposition (Q6184796) (← links)
- Computing and listing avoidable vertices and paths (Q6185944) (← links)
- On Structural Parameterizations of the Harmless Set Problem (Q6492087) (← links)
- Linear time algorithms for NP-hard problems restricted to \textsc{GaTEx} graphs (Q6591462) (← links)
- Polynomial Turing compressions for some graph problems parameterized by modular-width (Q6591463) (← links)
- Getting linear time in graphs of bounded neighborhood diversity (Q6599065) (← links)
