Results 11 to 20 of about 2,449,773 (154)
Small bipartite subgraph polytopes [PDF]
, 2010 We compute a complete linear description of the bipartite subgraph polytope, for up to seven nodes, and a conjectured complete description for eight nodes.
Galli, L, Letchford, A N
core +5 more sources
Mixing 3-Colourings in Bipartite Graphs [PDF]
European Journal of Combinatorics, 2007 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Luis Cereceda +2 more
openaire +3 more sources
Stacks, Queues and Tracks: Layouts of Graph Subdivisions [PDF]
Discrete Mathematics & Theoretical Computer Science, 2005 A k-stack layout (respectively, k-queuelayout) of a graph consists of a total order of the vertices, and a partition of the edges into k sets of non-crossing (non-nested) edges with respect to the vertex ordering.
Vida Dujmović, David R. Wood
doaj +2 more sources
Bipartitioning of directed and mixed random graphs [PDF]
Journal of Statistical Mechanics: Theory and Experiment, 2019 Abstract We show that an intricate relation of cluster properties and optimal bipartitions, which takes place in undirected random graphs, extends to directed and mixed random graphs. In particular, the satisfability threshold coincides with the relative size of the giant OUT component reaching 1/2.
Adam Lipowski +3 more
openaire +3 more sources
Maximization of the Spectral Gap for Chemical Graphs by means of a Solution to a Mixed Integer Semidefinite Program [PDF]
Computer Methods in Materials Science, 2016 In this paper we analyze the spectral gap of a weighted graph which is the difference between the smallest positive and largest negative eigenvalue of its adjacency matrix. Such a graph can represent e.g. a chemical organic molecule.
Soňa Pavlíková, Daniel Ševčovič
doaj +1 more source
Projecting an Extended Formulation for Mixed-Integer Covers on Bipartite Graphs [PDF]
Mathematics of Operations Research, 2010 We consider the mixed-integer version of bipartite vertex cover. This is equivalent to a mixed-integer network dual model, introduced recently, that generalizes several mixed-integer sets arising in production planning. We derive properties of inequalities that are valid for the convex hull of the mixed-integer bipartite covers by projecting an ...
CONFORTI, MICHELANGELO +2 more
openaire +1 more source
Outerplane bipartite graphs with isomorphic resonance graphs [PDF]
, 2023 We present novel results related to isomorphic resonance graphs of 2-connected outerplane bipartite graphs. As the main result, we provide a structure characterization for 2-connected outerplane bipartite graphs with isomorphic resonance graphs. Moreover,
Che, Zhongyuan +3 more
core +4 more sources
Matching algorithms to assist in designing with reclaimed building elements
Environmental Research: Infrastructure and Sustainability, 2023 Reuse of building components is one of the recommended circular strategies to reduce the environmental impact of new buildings. However, reclaimed building components are more difficult to design with than new products.
A Tomczak, S M Haakonsen, M Łuczkowski
doaj +1 more source
Slow mixing of Glauber dynamics for the hard‐core model on regular bipartite graphs [PDF]
Random Structures & Algorithms, 2005 AbstractLet ∑ = (V,E) be a finite, d‐regular bipartite graph. For any λ > 0 let πλ be the probability measure on the independent sets of ∑ in which the set I is chosen with probability proportional to λ|I| (πλ is the hard‐core measure with activity λ on ∑).
David J. Galvin, Prasad Tetali
openaire +4 more sources
Mixed-Integer Vertex Covers on Bipartite Graphs [PDF]
, 2007 Let A be the edge-node incidence matrix of a bipartite graph G¿=¿(U,V;E), I be a subset of the nodes of G, and b be a vector such that 2b is integral. We consider the following mixed-integer set: X(G,b,I) = {x : Ax=b, x=0, xi integer for all i¿I}. We characterize conv(X(G,b,I)) in its original space. That is, we describe a matrix (C,d) such that conv(X(
CONFORTI, MICHELANGELO +2 more
openaire +3 more sources