Minimum size tree-decompositions (Q5890931): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.endm.2015.07.005 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1574061374 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of Finding Embeddings in a <i>k</i>-Tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterization and Recognition of Partial 3-Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: The monadic second-order logic of graphs. I: Recognizable sets of finite graphs / 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: On Linear Recognition of Tree-Width at Most Four / rank
 
Normal rank
Property / cites work
 
Property / cites work: Steiner trees, partial 2–trees, and minimum IFI networks / rank
 
Normal rank

Latest revision as of 18:33, 12 July 2024

scientific article; zbMATH DE number 6639864
Language Label Description Also known as
English
Minimum size tree-decompositions
scientific article; zbMATH DE number 6639864

    Statements