Parameterized and Exact Computation
Springer Berlin (Verlag)
978-3-642-17492-6 (ISBN)
The Complexity of Satisfaction on Sparse Graphs.- Protrusions in Graphs and Their Applications.- Parameterized Complexity Results in Symmetry Breaking.- On the Kernelization Complexity of Colorful Motifs.- Partial Kernelization for Rank Aggregation: Theory and Experiments.- Enumerate and Measure: Improving Parameter Budget Management.- On the Exact Complexity of Evaluating Quantified k-CNF.- Cluster Editing: Kernelization Based on Edge Cuts.- Computing the Deficiency of Housing Markets with Duplicate Houses.- A New Lower Bound on the Maximum Number of Satisfied Clauses in Max-SAT and Its Algorithmic Application.- An Improved FPT Algorithm and Quadratic Kernel for Pathwidth One Vertex Deletion.- Multivariate Complexity Analysis of Swap Bribery.- Parameterizing by the Number of Numbers.- Are There Any Good Digraph Width Measures?.- On the (Non-)existence of Polynomial Kernels for P l -free Edge Modification Problems.- Parameterized Complexity Results for General Factors in Bipartite Graphs with an Application to Constraint Programming.- On the Grundy Number of a Graph.- Exponential Time Complexity of Weighted Counting of Independent Sets.- The Exponential Time Complexity of Computing the Probability That a Graph Is Connected.- Inclusion/Exclusion Branching for Partial Dominating Set and Set Splitting.- Small Vertex Cover Makes Petri Net Coverability and Boundedness Easier.- Proper Interval Vertex Deletion.
Erscheint lt. Verlag | 22.11.2010 |
---|---|
Reihe/Serie | Lecture Notes in Computer Science | Theoretical Computer Science and General Issues |
Zusatzinfo | X, 239 p. 18 illus. |
Verlagsort | Berlin |
Sprache | englisch |
Themenwelt | Informatik ► Theorie / Studium ► Algorithmen |
Mathematik / Informatik ► Mathematik ► Wahrscheinlichkeit / Kombinatorik | |
Schlagworte | Algorithm analysis and problem complexity • Algorithmics • algorithms • Approximation • classification • Colouring • Complexity • Complexity theory • Computational Complexity • Discrete Mathematics • exponential time • fixed parameter complexity • Graph Algorithms • online colouring • Optimization • parameterized algorithms • parameterized complexity • Petri Nets • sparse graphs • vertex color • vertex cove • vertex cover |
ISBN-10 | 3-642-17492-2 / 3642174922 |
ISBN-13 | 978-3-642-17492-6 / 9783642174926 |
Zustand | Neuware |
Haben Sie eine Frage zum Produkt? |
aus dem Bereich