Identifying the minor set cover of dense connected bipartite graphs via random matching edge sets
Abstract
Using quantum annealing to solve an optimization problem requires minor embedding a logic graph into a known hardware graph. We introduce the minor set cover (MSC) of a known graph GG : a subset of graph minors which contain any remaining minor of the graph as a subgraph, in an effort to reduce the complexity of the minor embedding problem. Any graph that can be embedded into GG will be embeddable into a member of the MSC. Focusing on embedding into the hardware graph of commercially available quantum annealers, we establish the MSC for a particular known virtual hardware, which is a complete bipartite graph. Furthermore, we show that the complete bipartite graph K _{N,N} has a MSC of N minors, from which K _{N+1} is identified as the largest clique minor of K _{N,N}. In the case of determining the largest clique minor of hardware with faults we briefly discussed this open question.
 Authors:
 Oak Ridge National Lab. (ORNL), Oak Ridge, TN (United States). Computer Science Mathematics Division
 Publication Date:
 Research Org.:
 Oak Ridge National Lab. (ORNL), Oak Ridge, TN (United States)
 Sponsoring Org.:
 USDOE
 OSTI Identifier:
 1361309
 Grant/Contract Number:
 AC0500OR22725
 Resource Type:
 Journal Article: Accepted Manuscript
 Journal Name:
 Quantum Information Processing
 Additional Journal Information:
 Journal Volume: 16; Journal Issue: 4; Journal ID: ISSN 15700755
 Publisher:
 Springer
 Country of Publication:
 United States
 Language:
 English
 Subject:
 97 MATHEMATICS AND COMPUTING; Minor embedding; Adiabatic quantum computing; Quantum annealing; Clique minor; Graph theory
Citation Formats
Hamilton, Kathleen E., and Humble, Travis S. Identifying the minor set cover of dense connected bipartite graphs via random matching edge sets. United States: N. p., 2017.
Web. doi:10.1007/s1112801615137.
Hamilton, Kathleen E., & Humble, Travis S. Identifying the minor set cover of dense connected bipartite graphs via random matching edge sets. United States. doi:10.1007/s1112801615137.
Hamilton, Kathleen E., and Humble, Travis S. Thu .
"Identifying the minor set cover of dense connected bipartite graphs via random matching edge sets". United States.
doi:10.1007/s1112801615137. https://www.osti.gov/servlets/purl/1361309.
@article{osti_1361309,
title = {Identifying the minor set cover of dense connected bipartite graphs via random matching edge sets},
author = {Hamilton, Kathleen E. and Humble, Travis S.},
abstractNote = {Using quantum annealing to solve an optimization problem requires minor embedding a logic graph into a known hardware graph. We introduce the minor set cover (MSC) of a known graph GG : a subset of graph minors which contain any remaining minor of the graph as a subgraph, in an effort to reduce the complexity of the minor embedding problem. Any graph that can be embedded into GG will be embeddable into a member of the MSC. Focusing on embedding into the hardware graph of commercially available quantum annealers, we establish the MSC for a particular known virtual hardware, which is a complete bipartite graph. Furthermore, we show that the complete bipartite graph KN,N has a MSC of N minors, from which KN+1 is identified as the largest clique minor of KN,N. In the case of determining the largest clique minor of hardware with faults we briefly discussed this open question.},
doi = {10.1007/s1112801615137},
journal = {Quantum Information Processing},
number = 4,
volume = 16,
place = {United States},
year = {Thu Feb 23 00:00:00 EST 2017},
month = {Thu Feb 23 00:00:00 EST 2017}
}
Web of Science

An efficient parallel algorithm to obtain maximum matchings in convex bipartite graphs is developed. This algorithm can be used to obtain efficient parallel algorithms for several scheduling problems. Some examples are: job scheduling with release times and deadlines; scheduling to minimize maximum cost; and preemptive scheduling to minimize maximum completion time.

A matrixalgebraic formulation of distributedmemory maximal cardinality matching algorithms in bipartite graphs
We describe parallel algorithms for computing maximal cardinality matching in a bipartite graph on distributedmemory systems. Unlike traditional algorithms that match one vertex at a time, our algorithms process many unmatched vertices simultaneously using a matrixalgebraic formulation of maximal matching. This generic matrixalgebraic framework is used to develop three efficient maximal matching algorithms with minimal changes. The newly developed algorithms have two benefits over existing graphbased algorithms. First, unlike existing parallel algorithms, cardinality of matching obtained by the new algorithms stays constant with increasing processor counts, which is important for predictable and reproducible performance. Second, relying on bulksynchronous matrix operations,more » 
Computing Maximum Cardinality Matchings in Parallel on Bipartite Graphs via TreeGrafting
It is difficult to obtain high performance when computing matchings on parallel processors because matching algorithms explicitly or implicitly search for paths in the graph, and when these paths become long, there is little concurrency. In spite of this limitation, we present a new algorithm and its sharedmemory parallelization that achieves good performance and scalability in computing maximum cardinality matchings in bipartite graphs. This algorithm searches for augmenting paths via specialized breadthfirst searches (BFS) from multiple source vertices, hence creating more parallelism than single source algorithms. Algorithms that employ multiplesource searches cannot discard a search tree once no augmenting pathmore »Cited by 1 
Minimally 2edgeconnected graphs
Minimally 2edgeconnected graphs are characterized. These are graphs that are 2edgeconnected such that, when any edge is removed, the remaining graph is only 1edge connected. The graphs are finite with multiple edges allowed. Loops are not allowed, since any minimally 2edgeconnected graph could not have them anyway. Since 2edgeconnected graphs are the edge analogs of blocks, they have a theory like blocks, only simpler. 3 figures. (RWR)