Pages that link to "Item:Q458504"
From MaRDI portal
The following pages link to A survey of the algorithmic aspects of modular decomposition (Q458504):
Displayed 50 items.
- Structural characterization and decomposition for cographs-(2, 1) and (1, 2): a natural generalization of threshold graphs (Q324752) (← links)
- Model counting for CNF formulas of bounded modular treewidth (Q334935) (← links)
- A polynomial kernel for \textsc{Feedback Arc Set} on bipartite tournaments (Q385516) (← links)
- Polynomial kernels for proper interval completion and related problems (Q393083) (← links)
- (Nearly-)tight bounds on the contiguity and linearity of cographs (Q393888) (← links)
- Tree-representation of set families and applications to combinatorial decompositions (Q412262) (← links)
- Split decomposition and graph-labelled trees: characterizations and fully dynamic algorithms for totally decomposable graphs (Q415271) (← links)
- Polynomial-time recognition of clique-width \(\leq 3\) graphs (Q415285) (← links)
- Practical and efficient split decomposition via graph-labelled trees (Q472485) (← links)
- Computing \(H\)-joins with application to 2-modular decomposition (Q486993) (← links)
- Approximate association via dissociation (Q505447) (← links)
- A polynomial Turing-kernel for weighted independent set in bull-free graphs (Q521799) (← links)
- A distance measure for large graphs based on prime graphs (Q531270) (← links)
- Complexity and parameterized algorithms for cograph editing (Q690461) (← links)
- On the complete width and edge clique cover problems (Q721937) (← links)
- Parameterized complexity of the list coloring reconfiguration problem with graph parameters (Q1643161) (← links)
- Towards an isomorphism dichotomy for hereditary graph classes (Q1693994) (← links)
- An efficient exact algorithm for triangle listing in large graphs (Q1741284) (← links)
- The minimum weakly connected independent set problem: polyhedral results and branch-and-cut (Q1751176) (← links)
- Parameterized algorithms for conflict-free colorings of graphs (Q1786593) (← links)
- On the (non-)existence of polynomial kernels for \(P _{l }\)-free edge modification problems (Q1949740) (← links)
- From modular decomposition trees to rooted median graphs (Q2074346) (← links)
- From modular decomposition trees to level-1 networks: pseudo-cographs, polar-cats and prime polar-cats (Q2172401) (← links)
- Grammars and clique-width bounds from split decompositions (Q2174558) (← links)
- On quasi-planar graphs: clique-width and logical description (Q2174559) (← links)
- Neighborhood covering and independence on \(P_4\)-tidy graphs and tree-cographs (Q2178334) (← links)
- Characterizations, probe and sandwich problems on \(( k , \ell )\)-cographs (Q2184673) (← links)
- Graph reconstruction in the congested clique (Q2186818) (← links)
- Covering minimal separators and potential maximal cliques in \(P_t\)-free graphs (Q2227825) (← links)
- Edge deletion problems: branching facilitated by modular decomposition (Q2257301) (← links)
- Modular decomposition of graphs and the distance preserving property (Q2312661) (← links)
- Polynomial-time algorithms for minimum weighted colorings of \((P_5, \overline{P}_5)\)-free graphs and similar graph classes (Q2345603) (← links)
- A characterisation of clique-width through nested partitions (Q2348055) (← links)
- Counting spanning trees using modular decomposition (Q2437761) (← links)
- Recognition of prime graphs from a prime subgraph (Q2449165) (← links)
- Parameterized algorithms for edge biclique and related problems (Q2636505) (← links)
- The use of a pruned modular decomposition for \textsc{maximum matching} algorithms on some graph classes (Q2659073) (← links)
- A general algorithmic scheme for combinatorial decompositions with application to modular decompositions of hypergraphs (Q2672614) (← links)
- Complete edge-colored permutation graphs (Q2672966) (← links)
- On Computing the Gromov Hyperbolicity (Q2828207) (← links)
- Metric Dimension of Bounded Width Graphs (Q2946381) (← links)
- A SAT Approach to Clique-Width (Q2946763) (← links)
- Positional Dominance: Concepts and Algorithms (Q2971635) (← links)
- On the (Non-)existence of Polynomial Kernels for P l -free Edge Modification Problems (Q3058699) (← links)
- Modular-Width: An Auxiliary Parameter for Parameterized Parallel Complexity (Q4632210) (← links)
- Fully Polynomial FPT Algorithms for Some Classes of Bounded Clique-width Graphs (Q4972678) (← links)
- 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)