Publications associées à Cycle (théorie des graphes)

Cliques of Neurons Bound into Cavities Provide a Missing Link between Structure and Function

Henry Markram, Kathryn Hess Bellwald, Michael Reimann, Rodrigo de Campos Perin, Giuseppe Chindemi, Martina Scolamiero, Ran Levi, Max Christian Nolte, Katharine Felicity Turner, Pawel Tadeusz Dlotko

The lack of a formal link between neural network structure and its emergent function has hampered our understanding of how the brain processes information. We have now come closer to describing such a link by taking the direction of synaptic transmission i ...

Frontiers Media Sa2017

Many disjoint edges in topological graphs

Andres Jacinto Ruiz Vargas

A monotone cylindrical graph is a topological graph drawn on an open cylinder with an infinite vertical axis satisfying the condition that every vertical line intersects every edge at most once. It is called simple if any pair of its edges have at most one ...

Elsevier Science Bv2017

Constant Factor Approximation for ATSP with Two Edge Weights

Ola Nils Anders Svensson, Jakub Tarnawski

We give a constant factor approximation algorithm for the Asymmetric Traveling Salesman Problem on shortest path metrics of directed graphs with two different edge weights. For the case of unit edge weights, the first constant factor approximation was give ...

Springer Int Publishing Ag2016

On the Difficulty of Selecting Ising Models with Approximate Recovery

Volkan Cevher, Jonathan Mark Scarlett

In this paper, we consider the problem of estimating the underlying graph associated with an Ising model given a number of independent and identically distributed samples. We adopt an approximate recovery criterion that allows for a number of missed edges ...

Ieee-Inst Electrical Electronics Engineers Inc2016

LUT Mapping and Optimization for Majority-Inverter Graphs

Giovanni De Micheli, Mathias Soeken, Pierre-Emmanuel Julien Marc Gaillardon, Luca Gaetano Amarù, Winston Jason Haaswijk

A Majority-Inverter Graph (MIG) is a directed acyclic graph in which every vertex represents a three-input majority operation and edges may be complemented to indicate operand inversion. MIGs have algebraic and Boolean properties that enable efficie ...

2016

AiiDA: automated interactive infrastructure and database for computational science

Nicola Marzari, Giovanni Pizzi, Boris Kozinsky, Andrea Cepellotti, Riccardo Sabatini

Computational science has seen in the last decades a spectacular rise in the scope, breadth, and depth of its efforts. Notwithstanding this prevalence and impact, it is often still performed using the renaissance model of individual artisans gathered in a ...

Elsevier Science Bv2016

An Efficient Streaming Algorithm for the Submodular Cover Problem

Volkan Cevher, Ilija Bogunovic, Ya-Ping Hsieh, Ashkan Norouzi Fard, Abbas Bazzi, Marwa El Halabi

We initiate the study of the classical Submodular Cover (SC) problem in the data streaming model which we refer to as the Streaming Submodular Cover (SSC). We show that any single pass streaming algorithm using sublinear memory in the size of the stream wi ...

2016

Boolean logic optimization in majority-inverter graphs

Giovanni De Micheli, Pierre-Emmanuel Julien Marc Gaillardon, Luca Gaetano Amarù

We present a Boolean logic optimization framework based on Majority-Inverter Graph (MIG). An MIG is a directed acyclic graph consisting of three-input majority nodes and regular/complemented edges. Current MIG optimization is supported by a consistent alge ...

2016

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.

Cycle (théorie des graphes)

Cliques of Neurons Bound into Cavities Provide a Missing Link between Structure and Function

Alignment and Assembly

Many disjoint edges in topological graphs

Constant Factor Approximation for ATSP with Two Edge Weights

On the Difficulty of Selecting Ising Models with Approximate Recovery

LUT Mapping and Optimization for Majority-Inverter Graphs

Simple topological graphs

AiiDA: automated interactive infrastructure and database for computational science

An Efficient Streaming Algorithm for the Submodular Cover Problem

Boolean logic optimization in majority-inverter graphs

Graph Chatbot

Chattez avec Graph Search

Simple topological graphs

Alignment and Assembly

Many disjoint edges in topological graphs

Boolean logic optimization in majority-inverter graphs

LUT Mapping and Optimization for Majority-Inverter Graphs

On the Difficulty of Selecting Ising Models with Approximate Recovery

Cliques of Neurons Bound into Cavities Provide a Missing Link between Structure and Function

AiiDA: automated interactive infrastructure and database for computational science

An Efficient Streaming Algorithm for the Submodular Cover Problem

Constant Factor Approximation for ATSP with Two Edge Weights