Graphs of Bounded Treewidth Can Be Canonized in  $\mbox{{\sf AC}$^1$}$ (Q3007628): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
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: A Logspace Algorithm for Partial 2-Tree Canonization / 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: Parallel Algorithms with Optimal Speedup for Bounded Treewidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Restricted Space Algorithms for Isomorphism on Bounded Treewidth Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: 3-connected Planar Graph Isomorphism is in Log-space / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph Isomorphism for K_{3, 3}-free and K_5-free graphs is in Log-space. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Testing Graph Isomorphism in Parallel by Playing a Game / rank
 
Normal rank
Property / cites work
 
Property / cites work: Logical Approaches to Computational Barriers / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Isomorphism Problem for k-Trees Is Complete for Logspace / rank
 
Normal rank
Property / cites work
 
Property / cites work: From Invariants to Canonization in Parallel / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4273608 / 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: Bounded Tree-Width and LOGCFL / rank
 
Normal rank

Latest revision as of 04:50, 4 July 2024

scientific article
Language Label Description Also known as
English
Graphs of Bounded Treewidth Can Be Canonized in  $\mbox{{\sf AC}$^1$}$
scientific article

    Statements

    Graphs of Bounded Treewidth Can Be Canonized in  $\mbox{{\sf AC}$^1$}$ (English)
    0 references
    0 references
    17 June 2011
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    bounded treewidth
    0 references
    graph isomorphism
    0 references
    canonization
    0 references
    0 references