Publications related to Simplex solids in SU(N) Heisenberg models on the kagome and checkerboard lattices

A Bayesian Method for Matching Two Similar Graphs without Seeds

Approximate graph matching (AGM) refers to the problem of mapping the vertices of two structurally similar graphs, which has applications in social networks, computer vision, chemistry, and biology. Given its computational cost, AGM has mostly been limited ...

2013

Graph-Constrained Group Testing

Amin Karbasi, Mahdi Cheraghchi Bashi Astaneh, Soheil Mohajerzefreh

Non-adaptive group testing involves grouping arbitrary subsets of

n

items into different pools. Each pool is then tested and defective items are identified. A fundamental question involves minimizing the number of pools required to identify at most

d

d ...

2012

Beyond Graphs: A New Synthesis

Dario Floreano, Claudio Mattiussi, Daniel Marbach, Peter Dürr

Artiﬁcial neural networks, electronic circuits, and gene networks are some examples of systems that can be modeled as networks, that is, as collections of interconnected nodes. In this paper we introduce the concept of terminal graph (t-graph for short), w ...

2011

A complete graph effective medium approximation for lattice and continuum percolation

Claudio Grimaldi

In this paper we introduce an effective medium theory that is capable of describing site percolation in both lattice and continuum three-dimensional systems. By exploiting self-consistency with a complete graph or network of identical conductors, the resul ...

2011

A bipartite strengthening of the Crossing Lemma

János Pach

Let G = (V, E) be a graph with n vertices and m >= 4n edges drawn in the plane. The celebrated Crossing Lemma states that G has at least Omega(m(3)/n(2)) pairs of crossing edges; or equivalently, there is an edge that crosses Omega(m(2)/n(2)) other edges. ...

2010

Weighted Gossip: Distributed Averaging Using Non-Doubly Stochastic Matrices

Martin Vetterli, Patrick Thiran, Florence Bénézit

This paper presents a general class of gossip-based averaging algorithms, which are inspired from Uniform Gossip [1]. While Uniform Gossip works synchronously on complete graphs, weighted gossip algorithms allow asynchronous rounds and converge on any conn ...

IEEE2010

Graph-Constrained Group Testing

Amin Karbasi, Mahdi Cheraghchi Bashi Astaneh, Soheil Mohajerzefreh

Non-adaptive group testing involves grouping arbitrary subsets of

n

items into different pools and identifying defective items based on tests obtained for each pool. Motivated by applications in network tomography, sensor networks and infection propagati ...

Ieee Service Center, 445 Hoes Lane, Po Box 1331, Piscataway, Nj 08855-1331 Usa2010

Graphs that Admit Right Angle Crossing Drawings

Radoslav Fulek, Balázs Keszegh, Filip Moric

We consider right angle crossing (RAC) drawings of graphs in which the edges are represented by polygonal arcs and any two edges can cross only at a right angle. We show that if a graph with n vertices admits a RAC drawing with at most 1 bend or 2 bends pe ...

2010

Degree-constrained edge partitioning in graphs arising from discrete tomography

Dominique de Werra, Bernard Ries

Starting from the basic problem of reconstructing a 2-dimensional image given by its projections on two axes, one associates a model of edge coloring in a complete bipartite graph. The complexity of the case with k=3 colors is open. Variations and special ...

2009

Blockers and transversals

Dominique de Werra, Bernard Ries, Rico Zenklusen

Given an undirected graph G = (V, E) with matching number v(G), we define d-blockers as subsets of edges B such that nu((V, E \ B)) = d. ...

2009

Simplex solids in SU(N) Heisenberg models on the kagome and checkerboard lattices

Graph Chatbot

Chat with Graph Search

A Bayesian Method for Matching Two Similar Graphs without Seeds

Graph-Constrained Group Testing

Beyond Graphs: A New Synthesis

A complete graph effective medium approximation for lattice and continuum percolation

A bipartite strengthening of the Crossing Lemma

Weighted Gossip: Distributed Averaging Using Non-Doubly Stochastic Matrices

Graph-Constrained Group Testing

Graphs that Admit Right Angle Crossing Drawings

Degree-constrained edge partitioning in graphs arising from discrete tomography

Blockers and transversals

Degree-constrained edge partitioning in graphs arising from discrete tomography

A complete graph effective medium approximation for lattice and continuum percolation

Weighted Gossip: Distributed Averaging Using Non-Doubly Stochastic Matrices

Graph-Constrained Group Testing

Graph-Constrained Group Testing

A Bayesian Method for Matching Two Similar Graphs without Seeds

Graphs that Admit Right Angle Crossing Drawings

Beyond Graphs: A New Synthesis

A bipartite strengthening of the Crossing Lemma

Blockers and transversals