Fixed-Parameter Tractable Canonization and Isomorphism Test for Graphs of Bounded Treewidth (Q2968151): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Q4091421 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Canonical representations of partial 2- and 3-trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: An introduction to clique minimal separator decomposition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial algorithms for graph isomorphism and chromatic index on partial k-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: A partial k-arboretum of graphs with bounded treewidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Necessary edges in \(k\)-chordalisations of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Tractable Parameterizations of Graph Isomorphism / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4426346 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3077955 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum bisection is fixed parameter tractable / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5315023 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fundamentals of parameterized complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parametrized complexity 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: Q3875946 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A V log V algorithm for isomorphism of triconnected planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4148000 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3549734 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Treewidth. Computations and approximations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Isomorphism for Graphs of Bounded Feedback Vertex Set Number / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal decomposition by clique separators / rank
 
Normal rank
Property / cites work
 
Property / cites work: Isomorphism of graphs of bounded valence can be tested in polynomial time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Isomorphism for Graphs of Bounded Connected-Path-Distance-Width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reduction Techniques for Graph Isomorphism in the Context of Width Parameters / rank
 
Normal rank
Property / cites work
 
Property / cites work: The isomorphism problem for classes of graphs closed under contraction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph minors. XIII: The disjoint paths problem / 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: Graph isomorphism is in the low hierarchy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposition by clique separators / rank
 
Normal rank
Property / cites work
 
Property / cites work: Myhill-Nerode Methods for Hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Isomorphism for graphs of bounded distance width / rank
 
Normal rank

Revision as of 12:35, 13 July 2024

scientific article
Language Label Description Also known as
English
Fixed-Parameter Tractable Canonization and Isomorphism Test for Graphs of Bounded Treewidth
scientific article

    Statements

    Fixed-Parameter Tractable Canonization and Isomorphism Test for Graphs of Bounded Treewidth (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    10 March 2017
    0 references
    graph isomorphism
    0 references
    bounded treewidth graphs
    0 references
    fixed-parameter tractability
    0 references
    canonization
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

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