Computational complexity of reconstruction and isomorphism testing for designs and line graphs (Q618291): 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.jcta.2010.06.006 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1930311219 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3396558 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Complexity of Canonical Labeling of Strongly Regular Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4871775 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4718790 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An optimal lower bound on the number of variables for graph identification / rank
 
Normal rank
Property / cites work
 
Property / cites work: Concerning the complexity of deciding isomorphism of block designs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3411976 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3861412 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3728911 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on optimal unimodular lattices / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Efficient Algorithm for Graph Isomorphism / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4886098 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Group-theoretic algorithms and graph isomorphism / rank
 
Normal rank
Property / cites work
 
Property / cites work: Flag-transitive Steiner Designs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial Designs for Authentication and Secrecy Codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coding Theory and Algebraic Combinatorics / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Steiner triple systems of order 19 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Logical Approaches to Computational Barriers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4273947 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A hole-size bound for incomplete t-wise balanced designs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5184924 / 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: Q4146667 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3863914 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the n<sup>log n</sup> isomorphism technique (A Preliminary Report) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Isomorphism of graphs which are pairwise k-separable / 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: Reconstructing Extended Perfect Binary One-Error-Correcting Codes From Their Minimum Distance Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An extension of the Erdoes, Ko, Rado theorem to t-designs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On t-designs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The graph isomorphism disease / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4787523 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4228513 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On construction and identification of graphs. With contributions by A. Lehman, G. M. Adelson-Velsky, V. Arlazarov, I. Faragev, A. Uskov, I. Zuev, M. Rosenfeld and B. Weisfeiler / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph isomorphism problem / rank
 
Normal rank

Latest revision as of 16:22, 3 July 2024

scientific article
Language Label Description Also known as
English
Computational complexity of reconstruction and isomorphism testing for designs and line graphs
scientific article

    Statements

    Computational complexity of reconstruction and isomorphism testing for designs and line graphs (English)
    0 references
    0 references
    14 January 2011
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    computational complexity
    0 references
    reconstructibility
    0 references
    isomorphism testing
    0 references
    combinatorial design
    0 references
    line graph
    0 references
    graph isomorphism problem
    0 references
    hypergraph isomorphism problem
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references