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 50 items.
- Parameterized algorithms for the module motif problem (Q342716) (← links)
- A polynomial kernel for \textsc{Feedback Arc Set} on bipartite tournaments (Q385516) (← links)
- Tree-representation of set families and applications to combinatorial decompositions (Q412262) (← links)
- Polynomial-time recognition of clique-width \(\leq 3\) graphs (Q415285) (← links)
- A fully dynamic algorithm for the recognition of \(P_4\)-sparse graphs (Q441871) (← links)
- Parameterized complexity of the weighted independent set problem beyond graphs of bounded clique number (Q450563) (← links)
- A survey of the algorithmic aspects of modular decomposition (Q458504) (← links)
- Restricted coloring problems on graphs with few \(P_4\)'s (Q490171) (← links)
- Transitive orientations in bull-reducible Berge graphs (Q531595) (← links)
- Polynomial kernels for 3-leaf power graph modification problems (Q602747) (← links)
- Polynomial cases for the vertex coloring problem (Q666663) (← links)
- On the complete width and edge clique cover problems (Q721937) (← links)
- Parameterized complexity of locally minimal defensive alliances (Q831707) (← links)
- The balanced satisfactory partition problem (Q831826) (← links)
- Solving some NP-complete problems using split decomposition (Q948695) (← links)
- Algorithms parameterized by vertex cover and modular width, through potential maximal cliques (Q1751087) (← links)
- On the Grundy number of graphs with few \(P_4\)'s (Q1759824) (← links)
- Minimal separators in extended \(P_4\)-laden graphs (Q1759855) (← links)
- Polynomial-time algorithm for isomorphism of graphs with clique-width at most three (Q1986558) (← links)
- On the harmless set problem parameterized by treewidth (Q2154099) (← links)
- Graph searches and their end vertices (Q2165035) (← links)
- From modular decomposition trees to level-1 networks: pseudo-cographs, polar-cats and prime polar-cats (Q2172401) (← links)
- Neighborhood covering and independence on \(P_4\)-tidy graphs and tree-cographs (Q2178334) (← links)
- The Small Set Vertex expansion problem (Q2232595) (← links)
- Refined notions of parameterized enumeration kernels with applications to matching cut enumeration (Q2237892) (← links)
- Partitioning graphs into induced subgraphs (Q2283104) (← links)
- Recognizing well covered graphs of families with special \(P _{4}\)-components (Q2376085) (← links)
- 4-coloring \((P_6, \text{bull})\)-free graphs (Q2403807) (← links)
- Counting spanning trees using modular decomposition (Q2437761) (← 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)
- Computing densest \(k\)-subgraph with structural parameters (Q2680362) (← links)
- Recognizing k-equistable Graphs in FPT Time (Q2827831) (← links)
- Unifying the representation of symmetric crossing families and weakly partitive families (Q2851484) (← links)
- (Q2857318) (← links)
- Metric Dimension of Bounded Width Graphs (Q2946381) (← links)
- Parameterized Algorithms for the Independent Set Problem in Some Hereditary Graph Classes (Q3000488) (← links)
- Cluster Editing: Kernelization Based on Edge Cuts (Q3058692) (← links)
- Erdös-Pósa Property of Obstructions to Interval Graphs (Q3304101) (← links)
- How Bad is the Freedom to Flood-It? (Q4622773) (← links)
- (Q4691867) (← links)
- (Q4961733) (← 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)
- Iterated Type Partitions (Q5041190) (← links)
- Target Set Selection in Dense Graph Classes (Q5062113) (← links)
- (Q5090996) (← links)
- (Q5091008) (← links)
- (Q5092394) (← links)
