Branch-width, parse trees, and monadic second-order logic for matroids. (Q2490835): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 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.jctb.2005.08.005 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1980469100 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4273870 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3812222 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4291429 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constructive linear time algorithms for branchwidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automatic generation of linear-time algorithms from predicate calculus descriptions of problems on recursively constructed graph families / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3785987 / 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: Linear time solvable optimization problems on graphs of bounded clique-width / 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: Q4393480 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the excluded minors for the matroids of branch-width \(k\) / 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: Mathematical Foundations of Computer Science 2003 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized and Exact Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3135082 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3684139 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph minors. X: Obstructions to tree-decomposition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating clique-width and branch-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph-Theoretic Concepts in Computer Science / rank
 
Normal rank
Property / cites work
 
Property / cites work: The structure of the models of decidable monadic theories of graphs / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 13:20, 24 June 2024

scientific article
Language Label Description Also known as
English
Branch-width, parse trees, and monadic second-order logic for matroids.
scientific article

    Statements

    Branch-width, parse trees, and monadic second-order logic for matroids. (English)
    0 references
    0 references
    18 May 2006
    0 references
    matroid representation
    0 references
    tree automaton
    0 references
    fixed-parameter complexity
    0 references

    Identifiers