Computing with Tangles (Q5890774): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
 
(One intermediate revision by one other user not shown)
Property / cites work
 
Property / cites work: Canonical tree-decompositions of finite graphs. II. Essential parts / rank
 
Normal rank
Property / cites work
 
Property / cites work: Connectivity and tree structure in finite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3077955 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vertex-minors, monadic second-order logic, and a conjecture by Seese / 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: A Simple Algorithm for the Graph Minor Decomposition − Logic meets Structural Graph Theory– / rank
 
Normal rank
Property / cites work
 
Property / cites work: Structure Theorem and Isomorphism Test for Graphs with Excluded Topological Subgraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding Branch-Decompositions and Rank-Decompositions / rank
 
Normal rank
Property / cites work
 
Property / cites work: A combinatorial, strongly polynomial-time algorithm for minimizing submodular functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simpler algorithm and shorter proof for the graph minor decomposition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rank-width and vertex-minors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating clique-width and branch-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Certifying large branch-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Testing branch-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5390304 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4352948 / 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: Graph minors. XVI: Excluding a non-planar graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: A combinatorial algorithm minimizing submodular functions in strongly polynomial time. / rank
 
Normal rank
Property / cites work
 
Property / cites work: The structure of the models of decidable monadic theories of graphs / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1137/15m1027565 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2415388303 / rank
 
Normal rank

Latest revision as of 08:44, 30 July 2024

scientific article; zbMATH DE number 6597502
Language Label Description Also known as
English
Computing with Tangles
scientific article; zbMATH DE number 6597502

    Statements

    Computing with Tangles (English)
    0 references
    0 references
    0 references
    23 June 2016
    0 references
    connectivity function
    0 references
    tangle
    0 references
    tree decomposition
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references