The isomorphism problem for \(k\)-trees is complete for logspace (Q714733): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
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.ic.2012.04.002 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2052024655 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4091421 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of planarity testing / rank
 
Normal rank
Property / cites work
 
Property / cites work: A very hard log-space counting class / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear time algorithms for NP-hard problems restricted to partial k- trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Space Complexity of k-Tree Isomorphism / 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: Graph Isomorphism is in SPP / 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: Structure and importance of logspace-MOD class / rank
 
Normal rank
Property / cites work
 
Property / cites work: A taxonomy of problems with fast parallel algorithms / 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: 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: Fast parallel reordering and isomorphism testing of \(k\)-trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Counting quantifiers, successor relations, and logarithmic 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: Group-theoretic algorithms and graph isomorphism / rank
 
Normal rank
Property / cites work
 
Property / cites work: Completeness results for graph isomorphism. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Isomorphism Testing in Hookup Classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4268436 / 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: Q4273947 / rank
 
Normal rank
Property / cites work
 
Property / cites work: From Invariants to Canonization in Parallel / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel Tree Contraction Part 2: Further Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4474083 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Undirected connectivity in log-space / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic Aspects of Vertex Elimination on Graphs / 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: On the Hardness of Graph Isomorphism / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graphs of Bounded Treewidth Can Be Canonized in  $\mbox{{\sf AC}$^1$}$ / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounded Tree-Width and LOGCFL / rank
 
Normal rank
Property / cites work
 
Property / cites work: Isomorphism for graphs of bounded distance width / rank
 
Normal rank

Latest revision as of 18:54, 5 July 2024

scientific article
Language Label Description Also known as
English
The isomorphism problem for \(k\)-trees is complete for logspace
scientific article

    Statements

    The isomorphism problem for \(k\)-trees is complete for logspace (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    11 October 2012
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    graph isomorphism
    0 references
    graph canonization
    0 references
    \(k\)-trees
    0 references
    space complexity
    0 references
    logspace completeness
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references