Colored hypergraph isomorphism is fixed parameter tractable (Q2258076): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: COLORED HYPERGRAPH ISOMORPHISM is fixed parameter tractable / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Hypergraph and Graph Isomorphism with Bounded Color Classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Canonizing Hypergraphs under Abelian Group Action / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3912033 / 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: Fixed-Parameter Tractability and Completeness I: Basic Results / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4503944 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Isomorphism of coloured graphs with slowly increasing multiplicity of Jordan blocks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parametrized complexity theory. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3912839 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3521460 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Completeness results for graph isomorphism. / 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: Q4273947 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Logical Approaches to Computational Barriers / 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: Q4273608 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hypergraph isomorphism and structural equivalence of Boolean functions / 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: Q5710169 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4787523 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5617749 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4190797 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Isomorphism for graphs of bounded distance width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3312272 / rank
 
Normal rank

Latest revision as of 18:12, 9 July 2024

scientific article
Language Label Description Also known as
English
Colored hypergraph isomorphism is fixed parameter tractable
scientific article

    Statements

    Colored hypergraph isomorphism is fixed parameter tractable (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    2 March 2015
    0 references
    fixed parameter tractability
    0 references
    fpt algorithms
    0 references
    graph isomorphism
    0 references
    computational complexity
    0 references

    Identifiers

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