The Space Complexity of k-Tree Isomorphism (Q5387816): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Johannes Köbler / rank
Normal rank
 
Property / author
 
Property / author: Johannes Köbler / rank
 
Normal rank
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.1007/978-3-540-77120-3_71 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1591409247 / rank
 
Normal rank
Property / cites work
 
Property / cites work: RUSPACE\((\log n)\subseteq \text{DSPACE}(\log^2n/\log \log n)\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5465356 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relationships among $PL$, $\#L$, and the determinant / 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: Q4266543 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3795218 / 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: Q4364501 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Isomorphism testing of k-trees is in NC, for fixed k / rank
 
Normal rank
Property / cites work
 
Property / cites work: NC algorithms for recognizing chordal graphs and k trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4342632 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Embeddings of \(k\)-connected graphs of pathwidth \(k\) / 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: Q4366883 / 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: 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: Treewidth. Computations and approximations / 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 of k-contractible graphs. A generalization of bounded valence and bounded genus / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4228513 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A combinatorial and logical approach to linear-time computability (extended abstract) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounded Tree-Width and LOGCFL / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 10:55, 28 June 2024

scientific article; zbMATH DE number 5279502
Language Label Description Also known as
English
The Space Complexity of k-Tree Isomorphism
scientific article; zbMATH DE number 5279502

    Statements

    The Space Complexity of k-Tree Isomorphism (English)
    0 references
    0 references
    0 references
    0 references
    27 May 2008
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references