Decomposition width of matroids (Q415290): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q57601380, #quickstatements; #temporary_batch_1706974296281
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 / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.dam.2011.03.016 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1966617477 / 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: Q3812222 / 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 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: Handbook of Graph Grammars and Computing by Graph Transformation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Branch-width and well-quasi-ordering in matroids and graphs. / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Rota's conjecture and excluded minors containing large projective geometries. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Excluding a planar graph from \(\mathrm{GF}(q)\)-representable matroids / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tangles, tree-decompositions and grids in matroids / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding Branch-Decompositions and Rank-Decompositions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matroid tree-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Addendum to matroid tree-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Parametrized Algorithm for Matroid Branch-Width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4418660 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mathematical Foundations of Computer Science 2003 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Branch-width, parse trees, and monadic second-order logic for matroids. / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Tutte Polynomial for Matroids of Bounded Branch-Width / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Matroid Representability and Minor Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing Representations of Matroids of Bounded Branch-Width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Testing branch-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating clique-width and branch-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3135082 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recognizing graphic matroids / rank
 
Normal rank
Property / cites work
 
Property / cites work: Monadic second-order model-checking on decomposable matroids / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4004142 / rank
 
Normal rank

Latest revision as of 05:22, 5 July 2024

scientific article
Language Label Description Also known as
English
Decomposition width of matroids
scientific article

    Statements

    Decomposition width of matroids (English)
    0 references
    0 references
    11 May 2012
    0 references
    0 references
    0 references
    0 references
    0 references
    matroids
    0 references
    matroid algorithms
    0 references
    branch-width
    0 references
    algorithmic metatheorems
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references