Graph isomorphism parameterized by elimination distance to bounded degree (Q309797): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q59475369, #quickstatements; #temporary_batch_1712186161777
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Graph isomorphism completeness for chordal bipartite graphs and strongly chordal graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Tractable Parameterizations of Graph Isomorphism / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4507228 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4393480 / 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: A generalization of Nemhauser and Trotter's local optimization theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph Layout Problems Parameterized by Vertex Cover / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parametrized complexity theory. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Structure theorem and isomorphism test for graphs with excluded topological subgraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized and Exact Computation / 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: Fixed-Parameter Tractable Canonization and Isomorphism Test for Graphs of Bounded Treewidth / 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: Q5710169 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The isomorphism problem for classes of graphs closed under contraction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Isomorphism for graphs of bounded distance width / rank
 
Normal rank

Latest revision as of 12:50, 12 July 2024

scientific article
Language Label Description Also known as
English
Graph isomorphism parameterized by elimination distance to bounded degree
scientific article

    Statements

    Graph isomorphism parameterized by elimination distance to bounded degree (English)
    0 references
    0 references
    0 references
    0 references
    7 September 2016
    0 references
    graph isomorphism
    0 references
    canonization
    0 references
    parameterized complexity
    0 references
    fixed-parameter tractable
    0 references
    bounded degree
    0 references
    graph theory
    0 references
    complexity theory
    0 references
    tree-depth
    0 references

    Identifiers