Concept

Graph minor

Related publications (143)

Graph Transformations preserving the stability number

We analyze the relations between several graph transformations that were introduced to be used in procedures determining the stability number of a graph. We show that all these transformations can be decomposed into a sequence of edge deletions and twin de ...

Elsevier Science Bv2012

Multi-Graph Sampling Of Online Communities Via Mean Hitting Time

We derive a framework for sampling online communities based on the mean hitting time of its members, considering that there are multiple graphs associated with the same vertex set V representing the social network. First, we formulate random walk models on ...

Ieee2012

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

Frédéric Mila, Karlo Penc

We present a numerical study of the SU(N) Heisenberg model with the fundamental representation at each site for the kagome lattice (for N = 3) and the checkerboard lattice (for N = 4), which are the line graphs of the honeycomb and square lattices and thus ...

2012

Intersection Patterns of Edges in Topological Graphs

Radoslav Fulek

This thesis is devoted to crossing patterns of edges in topological graphs. We consider the following four problems: A thrackle is a graph drawn in the plane such that every pair of edges meet exactly once: either at a common endpoint or in a proper crossi ...

EPFL2012

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

Extraction of network topology from multi-electrode recordings: is there a small-world effect?

Wulfram Gerstner, Joao Emanuel Felipe Gerhard

The simultaneous recording of the activity of many neurons poses challenges for multivariate data analysis. Here, we propose a general scheme of reconstruction of the functional network from spike train recordings. Effective, causal interactions are estima ...

Frontiers Research Foundation2011

Drawing planar graphs of bounded degree with few slopes

János Pach, Balázs Keszegh, Doemoetoer Palvoelgyi

We settle a problem of Dujmovic, Eppstein, Suderman, and Wood by showing that there exists a function f with the property that every planar graph G with maximum degree d admits a drawing with noncrossing straight-line edges, using at most f(d) different sl ...

Springer-Verlag New York, Ms Ingrid Cunningham, 175 Fifth Ave, New York, Ny 10010 Usa2011

Methods for Clustering Multi-Layer Graphs in Mobile Networks

Pascal Frossard, Pierre Vandergheynst, Xiaowen Dong

Clustering on graphs has been studied extensively for years due to its numerous applications. However, in contrast to the classic problems, clustering in mobile and online social networks brings new challenges. In these scenarios, it is common that observa ...

2011

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

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

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