skip to content
Parameterized and exact computation : 5th international symposium, IPEC 2010, Chennai, India, December 13-15, 2010 : proceedings Preview this item
ClosePreview this item
Checking...

Parameterized and exact computation : 5th international symposium, IPEC 2010, Chennai, India, December 13-15, 2010 : proceedings

Author: V Raman; Saket Saurabh
Publisher: Berlin : Springer, 2010.
Series: Lecture notes in computer science, 6478.; LNCS sublibrary., SL 1,, Theoretical computer science and general issues.
Edition/Format:   eBook : Document : Conference publication : EnglishView all editions and formats
Database:WorldCat
Summary:
Annotation
Rating:

(not yet rated) 0 with reviews - Be the first.

Subjects
More like this

 

Find a copy online

Find a copy in the library

&AllPage.SpinnerRetrieving; Finding libraries that hold this item...

Details

Genre/Form: Electronic books
Kongress
Conference proceedings
Congresses
Additional Physical Format: Print version:
Parameterized and exact computation.
Berlin : Springer, 2010
(DLC) 2010939810
(OCoLC)690102277
Material Type: Conference publication, Document, Internet resource
Document Type: Internet Resource, Computer File
All Authors / Contributors: V Raman; Saket Saurabh
ISBN: 9783642174933 3642174930
OCLC Number: 697300455
Notes: International conference proceedings.
Title from title screen (SpringerLink, viewed Jan. 13, 2011).
Description: 1 online resource (x, 238 p.) : ill.
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.
Series Title: Lecture notes in computer science, 6478.; LNCS sublibrary., SL 1,, Theoretical computer science and general issues.
Other Titles: IPEC 2010
Responsibility: Venkatesh Raman, Saket Saurabh (eds.).
More information:

Abstract:

Constitutes the refereed best selected papers of the 5th International Symposium on Parameterized and Exact Computation, IPEC 2010, held in Chennai, India, in December 2010.  Read more...

Reviews

User-contributed reviews
Retrieving GoodReads reviews...
Retrieving DOGObooks reviews...

Tags

Be the first.
Confirm this request

You may have already requested this item. Please select Ok if you would like to proceed with this request anyway.

Linked Data


<http://www.worldcat.org/oclc/697300455>
library:oclcnum"697300455"
library:placeOfPublication
library:placeOfPublication
owl:sameAs<info:oclcnum/697300455>
rdf:typeschema:Book
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:bookFormatschema:EBook
schema:contributor
schema:contributor
schema:creator
schema:datePublished"2010"
schema:exampleOfWork<http://worldcat.org/entity/work/id/787153578>
schema:genre"Conference proceedings."@en
schema:genre"Conference proceedings"@en
schema:genre"Electronic books."@en
schema:genre"Kongress."@en
schema:inLanguage"en"
schema:name"Parameterized and exact computation 5th international symposium, IPEC 2010, Chennai, India, December 13-15, 2010 : proceedings"@en
schema:name"IPEC 2010"@en
schema:numberOfPages"238"
schema:publisher
schema:url
schema:url<http://rave.ohiolink.edu/ebooks/ebc/9783642174933>
schema:url<http://books.scholarsportal.info/viewdoc.html?id=/ebooks/ebooks2/springer/2011-02-17/1/9783642174933>
schema:url<http://dx.doi.org/10.1007/978-3-642-17493-3>
schema:workExample

Content-negotiable representations

Close Window

Please sign in to WorldCat 

Don't have an account? You can easily create a free account.