Almost Optimal Lower Bounds for Problems Parameterized by Clique-Width

SIAM Journal on Computing- United States

doi 10.1137/130910932

Full Text

Abstract

Available in

Date

Authors

Publisher

Society for Industrial & Applied Mathematics (SIAM)

Related search

Upper Bounds to the Clique Width of Graphs

Discrete Applied Mathematics
CombinatoricsApplied MathematicsDiscrete Mathematics
2000English

Lower Bounds for the Parameterized Complexity of Minimum Fill-In and Other Completion Problems

2015English

Calculating Lower Bounds for Caching Problems

Computing (Vienna/New York)
Numerical AnalysisComputational TheoryComputer Science ApplicationsComputational MathematicsMathematicsTheoretical Computer ScienceSoftware
2007English

Approximating Rank-Width and Clique-Width Quickly

ACM Transactions on Algorithms
Mathematics
2008English

Linear Time Solvable Optimization Problems on Graphs of Bounded Clique Width

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
1998English

ALMOST OPTIMAL SOLUTIONS TO K-Clustering PROBLEMS

International Journal of Computational Geometry and Applications
GeometryApplied MathematicsComputational TheoryComputational MathematicsMathematicsTheoretical Computer ScienceTopology
2010English

Near-Optimal Small-Depth Lower Bounds for Small Distance Connectivity

2016English

Optimal Lower Bounds for Distributed and Streaming Spanning Forest Computation

2019English

Optimal Lower Bounds for Quantum Automata and Random Access Codes

English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy