Pages that link to "Item:Q458504"
From MaRDI portal
The following pages link to A survey of the algorithmic aspects of modular decomposition (Q458504):
Displaying 29 items.
- Counting Weighted Independent Sets beyond the Permanent (Q4997141) (← links)
- Efficient and Adaptive Parameterized Algorithms on Modular Decompositions (Q5009620) (← links)
- (Q5018489) (← links)
- Parameterized Complexity of Geodetic Set (Q5050005) (← links)
- Hierarchical and modularly-minimal vertex colorings (Q5058209) (← links)
- An Analytic Propositional Proof System on Graphs (Q5060181) (← links)
- (Q5090996) (← links)
- Parameterized Complexity of the List Coloring Reconfiguration Problem with Graph Parameters (Q5111266) (← links)
- Cograph editing: Merging modules is equivalent to editing P_4s (Q5121555) (← links)
- Finding Large $H$-Colorable Subgraphs in Hereditary Graph Classes (Q5163508) (← links)
- (Q5227528) (← links)
- PARTITION REFINEMENT TECHNIQUES: AN INTERESTING ALGORITHMIC TOOL KIT (Q5248997) (← links)
- Metric Dimension of Bounded Tree-length Graphs (Q5268001) (← links)
- A Theoretical Framework for Instance Complexity of the Resource-Constrained Project Scheduling Problem (Q5870371) (← links)
- When can graph hyperbolicity be computed in linear time? (Q5915992) (← links)
- Independent set reconfiguration parameterized by modular-width (Q5918925) (← links)
- Spined categories: generalizing tree-width beyond graphs (Q6056559) (← links)
- Efficient parameterized algorithms for computing all-pairs shortest paths (Q6069155) (← links)
- Parameterized Complexity of Geodetic Set (Q6089667) (← links)
- Grouped domination parameterized by vertex cover, twin cover, and beyond (Q6131196) (← links)
- Symmetric maximal Condorcet domains (Q6171422) (← 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)
- Modules in Robinson Spaces (Q6187080) (← links)
- \(\boldsymbol{(\alpha, \beta )}\)-Modules in Graphs (Q6188517) (← 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)
- Cutting a tree with subgraph complementation is hard, except for some small trees (Q6595520) (← links)
- Hypergraphs with polynomial representation: introducing \(r\)-splits (Q6599817) (← links)
