1 option
Parameterized and Exact Computation : 5th International Symposium, IPEC 2010, Chennai, India, December 13-15, 2010. Proceedings / edited by Venkatesh Raman, Saket Saurabh.
SpringerLink Books Lecture Notes In Computer Science (LNCS) (1997-2024) Available online
View online- Format:
- Book
- Series:
- Computer Science (Springer-11645)
- LNCS sublibrary. Theoretical computer science and general issues ; SL 1, 6478.
- Theoretical Computer Science and General Issues ; 6478
- Language:
- English
- Subjects (All):
- Algorithms.
- Computer science--Mathematics.
- Computer science.
- Computers.
- Algorithm Analysis and Problem Complexity.
- Discrete Mathematics in Computer Science.
- Theory of Computation.
- Symbolic and Algebraic Manipulation.
- Computation by Abstract Devices.
- Local Subjects:
- Algorithm Analysis and Problem Complexity.
- Algorithms.
- Discrete Mathematics in Computer Science.
- Theory of Computation.
- Symbolic and Algebraic Manipulation.
- Computation by Abstract Devices.
- Physical Description:
- 1 online resource (X, 239 pages) : 18 illustrations.
- Edition:
- First edition 2010.
- Contained In:
- Springer eBooks
- Place of Publication:
- Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2010.
- System Details:
- text file PDF
- Contents:
- 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.
- Other Format:
- Printed edition:
- ISBN:
- 978-3-642-17493-3
- 9783642174933
- Access Restriction:
- Restricted for use by site license.
The Penn Libraries is committed to describing library materials using current, accurate, and responsible language. If you discover outdated or inaccurate language, please fill out this feedback form to report it and suggest alternative language.