Identifying the minor set cover of dense connected bipartite graphs via random matching edge sets (Q2412632): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / OpenAlex ID
 
Property / OpenAlex ID: W2563362990 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1612.07366 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Quantum Adiabatic Evolution Algorithm Applied to Random Instances of an NP-Complete Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear connectivity forces large complete bipartite minors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minor-embedding in adiabatic quantum computation. I: The parameter setting problem / 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: Algorithms for graphs embeddable with few crossings per edge / rank
 
Normal rank
Property / cites work
 
Property / cites work: Preprocessing subgraph and minor problems: when does a small vertex cover help? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adiabatic quantum programming: minor embedding with hard faults / rank
 
Normal rank
Property / cites work
 
Property / cites work: Systematic and deterministic graph minor embedding for Cartesian products of graphs / 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: Graph minors. VIII: A Kuratowski theorem for general surfaces / 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 minors. V. Excluding a planar graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of H-coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tight Lower Bounds on Graph Embedding Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graphs without minor complete subgraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Über eine Eigenschaft der ebenen Komplexe / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph minors. I. Excluding a forest / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph minors. XVI: Excluding a non-planar graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph minors. XX: Wagner's conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some recent progress and applications in graph minor theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: The extremal function for \(K_{9}\) minors / rank
 
Normal rank
Property / cites work
 
Property / cites work: The order of the largest complete minor in a random graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minors in random regular graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complete graph minors and the graph minor structure theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Grid minors in damaged grids / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bound of the Hadwiger number of graphs by their average degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: The extremal function for complete minors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dense minors in graphs of large girth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Disjoint unions of complete minors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4291429 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms - ESA 2003 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph isomorphism in quasipolynomial time [extended abstract] / rank
 
Normal rank

Latest revision as of 14:23, 14 July 2024

scientific article
Language Label Description Also known as
English
Identifying the minor set cover of dense connected bipartite graphs via random matching edge sets
scientific article

    Statements

    Identifying the minor set cover of dense connected bipartite graphs via random matching edge sets (English)
    0 references
    0 references
    0 references
    24 October 2017
    0 references
    minor embedding
    0 references
    adiabatic quantum computing
    0 references
    quantum annealing
    0 references
    Clique minor
    0 references
    graph theory
    0 references
    0 references
    0 references

    Identifiers

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