Query efficient implementation of graphs of bounded clique-width (Q1408820): 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: A partial k-arboretum of graphs with bounded treewidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Shortest paths in digraphs of small treewidth. II: Optimal parallel algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Shortest paths in digraphs of small treewidth. I: Sequential algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fundamental properties of infinite trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Monadic second-order definable graph transductions: a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Handbook of Graph Grammars and Computing by Graph Transformation / 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: Monadic second-order logic, graph coverings and unfoldings of transition systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2768294 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic algorithms for graphs of bounded treewidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4385530 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 10:27, 6 June 2024

scientific article
Language Label Description Also known as
English
Query efficient implementation of graphs of bounded clique-width
scientific article

    Statements

    Identifiers