Algorithms for vertex-partitioning problems on graphs with fixed clique-width. (Q1874418): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algebraic theory of graph reduction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Easy problems for tree-decomposable graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A partial k-arboretum of graphs with bounded treewidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Majority domination in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4508369 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Handle-rewriting hypergraph grammars / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear time solvable optimization problems on graphs of bounded clique-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the fixed parameter complexity of graph enumeration problems definable in monadic second-order logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Monadic second-order evaluations on tree-decomposable graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Upper bounds to the clique width of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fixed-Parameter Tractability and Completeness I: Basic Results / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fixed-parameter tractability and completeness II: On completeness for W[1] / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3691778 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3691779 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic approach to the satisfactory graph partitioning problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Splitting trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2768335 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph minors. II. Algorithmic aspects of tree-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for Vertex Partitioning Problems on Partial k-Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic aspects of majority domination / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph colorings with local constraints -- a survey / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 15:54, 5 June 2024

scientific article
Language Label Description Also known as
English
Algorithms for vertex-partitioning problems on graphs with fixed clique-width.
scientific article

    Statements

    Algorithms for vertex-partitioning problems on graphs with fixed clique-width. (English)
    0 references
    0 references
    0 references
    25 May 2003
    0 references
    Graph partitioning
    0 references
    Polynomial algorithms
    0 references
    Clique-width
    0 references

    Identifiers