Systematic and deterministic graph minor embedding for Cartesian products of graphs (Q1679291): Difference between revisions

From MaRDI portal
Changed an Item
Normalize DOI.
 
(6 intermediate revisions by 6 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s11128-017-1569-z / rank
Normal rank
 
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2963711262 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1602.04274 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Faster parameterized algorithms for minor containment / rank
 
Normal rank
Property / cites work
 
Property / cites work: Treewidth computations. I: Upper bounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast clique minor generation in Chimera qubit connectivity graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minor-embedding in adiabatic quantum computation. II: Minor-universal graph design / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear and quadratic programming approaches for the general graph partitioning problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2716030 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On tree width, bramble size, and expansion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph Partitioning and Continuous Quadratic Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recognizing Cartesian products in linear time / rank
 
Normal rank
Property / cites work
 
Property / cites work: The problem of the rooks and its applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Achievable sets, brambles, and sparse treewidth obstructions / rank
 
Normal rank
Property / cites work
 
Property / cites work: A case study in programming a quantum annealer for hard operational planning problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph searching and a min-max theorem for tree-width / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S11128-017-1569-Z / rank
 
Normal rank

Latest revision as of 02:52, 11 December 2024

scientific article
Language Label Description Also known as
English
Systematic and deterministic graph minor embedding for Cartesian products of graphs
scientific article

    Statements

    Systematic and deterministic graph minor embedding for Cartesian products of graphs (English)
    0 references
    9 November 2017
    0 references
    graph minor embedding
    0 references
    Cartesian product
    0 references
    quantum annealing
    0 references
    chip architecture
    0 references

    Identifiers