Computer Science – Data Structures and Algorithms
Scientific paper
2011-04-15
Computer Science
Data Structures and Algorithms
26 pages, 1 figure
Scientific paper
We introduce a variant of modal logic, dubbed EXISTENTIAL COUNTING MODAL LOGIC (ECML), which captures a vast majority of problems known to be tractable in single exponential time when parameterized by treewidth. It appears that all these results can be subsumed by the theorem that model checking of ECML admits an algorithm with such complexity. We extend ECML by adding connectivity requirements and, using the Cut&Count technique introduced by Cygan et al. [4], prove that problems expressible in the extension are also tractable in single exponential time when parameterized by treewidth; however, using randomization. The need for navigationality of the introduced logic is justified by a negative result that two expository problems involving non-acyclic conditions, C_l VERTEX DELETION and GIRTH>l VERTEX DELETION for l>=5, do not admit such a robust algorithm unless Exponential Time Hypothesis fails.
No associations
LandOfFree
Problems parameterized by treewidth tractable in single exponential time: a logical approach does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Problems parameterized by treewidth tractable in single exponential time: a logical approach, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Problems parameterized by treewidth tractable in single exponential time: a logical approach will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-8942