Mediaspace scheduled maintenance: Aug 25, 2026 07:00 - 12:00 AM. During this time, videos will be temporarily unavailable. Check status updates.

Concept

Adjacency list

Related publications (28)

Whole-brain structural connectivity in temporal lobe epilepsy: a Diffusion Spectrum Imaging study

Jean-Philippe Thiran, Alessandro Daducci, Alessandra Griffa, Alia Lemkaddem, François Lazeyras

Introduction: Medial Temporal Lobe Epilepsy (mTLE) with hippocampal sclerosis is the most frequent cause of drug-resistant focal epilepsy in adults. These patients suffer from widespread subtle white matter abnormalities and abnormal functional connectivit ...

2012

Hanani-Tutte and Monotone Drawings

Radoslav Fulek

A drawing of a graph is x-monotone if every edge intersects every vertical line at most once and every vertical line contains at most one vertex. Pach and Toth showed that if a graph has an x-monotone drawing in which every pair of edges crosses an even nu ...

Springer-Verlag Berlin2011

A Game Theoretic Approach to Expander-based Compressive Sensing

Volkan Cevher

We consider the following expander-based compressive sensing (e-CS) problem: Given Φ ∈ ℝM×N (M

IEEE2011

Adjacent Crossings Do Matter

Radoslav Fulek

In a drawing of a graph, two edges form an odd pair if they cross each other an odd number of times. A pair of edges is independent if they share no endpoint. For a graph G, let ocr(G) be the smallest number of odd pairs in a drawing of G and let iocr(G) b ...

Springer-Verlag Berlin2011

Stabilizing patterning in the Drosophila segment polarity network by selecting models in silico

Felix Naef, Jacques Rougemont, Mirko Bischofberger

The segmentation of Drosophila is a prime model to study spatial patterning during embryogenesis. The spatial expression of segment polarity genes results from a complex network of interacting proteins whose expression products are maintained after success ...

Elsevier2010

A Magnetic Procedure for the Stability Number

Dominique de Werra

A magnet is a pair u, v of adjacent vertices such that the proper neighbours of u are completely linked to the proper neighbours of v. It has been shown that one can reduce the graph by removing the two vertices u, v of a magnet and introducing a new verte ...

2009

On two coloring problems in mixed graphs

Dominique de Werra, Bernard Ries

We are interested in coloring the vertices of a mixed graph, i.e., a graph containing edges and arcs. We consider two different coloring problems: in the first one we want adjacent vertices to have different colors and the tail of an arc to get a color str ...

2008

A graph coloring heuristic using partial solutions and a reactive tabu scheme

Nicolas Zufferey

Most of the recent heuristics for the graph coloring problem start from an infeasible k-coloring (adjacent vertices may have the same color) and try to make the solution feasible through a sequence of color exchanges. In contrast, our approach (called FOO- ...

2008