Approximating Rank-Width and Clique-Width Quickly

ACM Transactions on Algorithms - United States
doi 10.1145/1435375.1435385
Full Text
Abstract

Available in full text

Categories
Mathematics
Date
Authors
Publisher

Association for Computing Machinery (ACM)

Related search

Parity Games of Bounded Tree- And Clique-Width

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2015English

From Tree-Decompositions to Clique-Width Terms

Discrete Applied Mathematics
CombinatoricsApplied MathematicsDiscrete Mathematics
2018English

Collective Tree Spanners in Graphs With Bounded Genus, Chordality, Tree-Width, or Clique-Width

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2005English

Approximating Hereditary Discrepancy via Small Width Ellipsoids

2014English

Upper Bounds to the Clique Width of Graphs

Discrete Applied Mathematics
CombinatoricsApplied MathematicsDiscrete Mathematics
2000English

Almost Optimal Lower Bounds for Problems Parameterized by Clique-Width

SIAM Journal on Computing
MathematicsComputer Science
2014English

Infinitely Many Minimal Classes of Graphs of Unbounded Clique-Width

Discrete Applied Mathematics
CombinatoricsApplied MathematicsDiscrete Mathematics
2018English

Linear Time Solvable Optimization Problems on Graphs of Bounded Clique Width

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
1998English

Road Width and Accidents

Nature
Multidisciplinary
1935English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy