Efficient Algorithms for Counting Parameterized List H-Colorings

Journal of Computer and System Sciences - United States
doi 10.1016/j.jcss.2008.02.004
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Elsevier BV

Related search

Efficient Algorithms for Large-Scale Local Triangle Counting

ACM Transactions on Knowledge Discovery from Data
Computer Science
2010English

Improved Parameterized Algorithms for Network Query Problems

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2014English

Some Hard Families of Parameterized Counting Problems

ACM Transactions on Computation Theory
Computational TheoryTheoretical Computer ScienceMathematics
2015English

Counting and Finding Homomorphisms Is Universal for Parameterized Complexity Theory

2020English

An Overview of Techniques for Designing Parameterized Algorithms

Computer Journal
Computer Science
2007English

The Origins of Counting Algorithms

Psychological Science
Psychology
2015English

Linear Time Parameterized Algorithms via Skew-Symmetric Multicuts

2013English

Efficient Algorithms for Sequence Segmentation

2006English

Efficient Algorithms for Sequence Analysis

1993English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2026 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy