z-logo
open-access-imgOpen Access
Deciding Clique-Width for Graphs of Bounded Tree-Width
Author(s) -
Wolfgang Espelage,
Frank Gurski,
Egon Wanke
Publication year - 2001
Publication title -
lecture notes in computer science
Language(s) - English
Resource type - Book series
SCImago Journal Rank - 0.249
H-Index - 400
eISSN - 1611-3349
pISSN - 0302-9743
DOI - 10.1007/3-540-44634-6_9
Subject(s) - bounded function , treewidth , clique , computer science , combinatorics , graph , integer (computer science) , tree (set theory) , discrete mathematics , clique width , mathematics , pathwidth , line graph , mathematical analysis , voltage graph , programming language

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom