Iterated Type Partitions

DOI10.1007/978-3-030-48966-3_15MaRDI QIDQ5041190zbMATH OpenOpenAlexFDO

Authors Gennaro Cordasco, Adele A. Rescigno, Luisa Gargano

Publication date 13 October 2022

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/2001.08122

zbMATH Keywords

fixed-parameter tractable algorithmsmodular-widthneighborhood diversityparameterized complexityW[1-hardness]

Mathematics Subject Classification ID

Discrete mathematics in relation to computer science (68Rxx) Algorithms in computer science (68Wxx)

Recommendations

• Parameterized complexity for iterated type partitions and modular-width
• What makes equitable connected partition easy
• Structural parameterizations for equitable coloring
• scientific article; zbMATH DE number 7058467

Cites work

• Algorithmic meta-theorems for restrictions of treewidth
• Bin packing with fixed number of bins revisited
• Clique-width is NP-complete
• Clique-width: on the price of generality
• Cluster vertex deletion: a parameterization between vertex cover and clique-width
• Complexity of conflict-free colorings of graphs
• Equitable colorings of bounded treewidth graphs
• Evangelism in social networks: algorithms and complexity
• Fixed Parameter Complexity of Distance Constrained Labeling and Uniform Channel Assignment Problems
• Graph Layout Problems Parameterized by Vertex Cover
• scientific article; zbMATH DE number 1161563 (Why is no real title available?)
• scientific article; zbMATH DE number 6850484 (Why is no real title available?)
• scientific article; zbMATH DE number 7058467 (Why is no real title available?)
• scientific article; zbMATH DE number 2234775 (Why is no real title available?)
• Integer programming in parameterized complexity: three miniatures
• Integer Programming with a Fixed Number of Variables
• Intractability of clique-width parameterizations
• Linear time solvable optimization problems on graphs of bounded clique-width
• Metric dimension of bounded width graphs
• On the complexity of some colorful problems parameterized by treewidth
• Parameterized Algorithms for Modular-Width
• Parameterized complexity of coloring problems: treewidth versus vertex cover
• Simpler Linear-Time Modular Decomposition Via Recursive Factorizing Permutations
• Target set selection in dense graph classes
• The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
• The monotone circuit value problem with bounded genus is in NC
• Total domination in graphs
• Transitiv orientierbare Graphen

Cited in

(8)

• Immunization in the threshold model: a parameterized complexity study
• Structural parameterizations for equitable coloring: complexity, FPT algorithms, and kernelization
• Parameterized complexity for iterated type partitions and modular-width
• Spanning trees with few branch vertices in graphs of bounded neighborhood diversity
• Equitable colorings of \(l\)-corona products of cubic graphs
• (t, r)-broadcast domination in graphs
• Spanning trees minimizing branching costs
• Structural parameters for dense temporal graphs

This page was built for publication: Iterated Type Partitions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5041190)