Parity Games of Bounded Tree- And Clique-Width

Lecture Notes in Computer Science - Germany
doi 10.1007/978-3-662-46678-0_25
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer Berlin Heidelberg

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

From Tree-Decompositions to Clique-Width Terms

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

Parametric Problems on Graphs of Bounded Tree-Width

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
1992English

Approximating Rank-Width and Clique-Width Quickly

ACM Transactions on Algorithms
Mathematics
2008English

Graphs With Bounded Tree-Width and Large Odd-Girth Are Almost Bipartite

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

Upper Bounds to the Clique Width of Graphs

Discrete Applied Mathematics
CombinatoricsApplied MathematicsDiscrete Mathematics
2000English

Mean-Payoff Parity Games

English

Timed Parity Games: Complexity and Robustness

Logical Methods in Computer Science
Computer ScienceTheoretical Computer Science
2011English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy