From Tree-Decompositions to Clique-Width Terms

Discrete Applied Mathematics - Netherlands
doi 10.1016/j.dam.2017.04.040
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Elsevier BV

Related search

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

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2005English

Parity Games of Bounded Tree- And Clique-Width

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2015English

Approximating Rank-Width and Clique-Width Quickly

ACM Transactions on Algorithms
Mathematics
2008English

Fractional Clique Decompositions of Dense Partite Graphs

Combinatorics Probability and Computing
StatisticsProbabilityApplied MathematicsMathematicsComputational TheoryTheoretical Computer Science
2017English

Upper Bounds to the Clique Width of Graphs

Discrete Applied Mathematics
CombinatoricsApplied MathematicsDiscrete Mathematics
2000English

Directed Tree-Width

Journal of Combinatorial Theory. Series B
CombinatoricsComputational TheoryDiscrete MathematicsTheoretical Computer ScienceMathematics
2001English

Tree Decompositions and Social Graphs

Internet Mathematics
Computational MathematicsApplied MathematicsSimulationModeling
2016English

Subdirect Decompositions of Lattices of Width Two

Pacific Journal of Mathematics
Mathematics
1968English

Infinitely Many Minimal Classes of Graphs of Unbounded Clique-Width

Discrete Applied Mathematics
CombinatoricsApplied MathematicsDiscrete Mathematics
2018English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy