Publications related to Directed acyclic graph

Graph signals offer a very generic and natural representation for data that lives on networks or irregular structures. The actual data structure is however often unknown a priori but can sometimes be estimated from the knowledge of the application domain. ...

Ieee2017

Analysing the Role of Social Visits on Migrants’ Social Capital: A Personal Network Approach

Emmanuel Pierre Jean Ravalet, Gil Viry

There are concerns that migrants may be embedded in far-flung networks with support being less collective. The spatial dispersion of their relatives and friends would result in fragmented networks with lower solidarity and lower mutual trust than densely c ...

2017

Decreased integration and information capacity in stroke measured by whole brain models of resting state activity

Alessandra Griffa, Patric Hagmann

While several studies have shown that focal lesions affect the communication between structurally normal regions of the brain, and that these changes may correlate with behavioural deficits, their impact on brain's information processing capacity is curren ...

Oxford Univ Press2017

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

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

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

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

Disjoint edges in topological graphs and the tangled-thrackle conjecture

Andres Jacinto Ruiz Vargas

It is shown that fora constant t is an element of N, every simple topological graph on n vertices has 0(n) edges if the graph has no two sets of t edges such that every edge in one set is disjoint from all edges of the other set (i.e., the complement of th ...

Academic Press Ltd- Elsevier Science Ltd2016

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.

Directed acyclic graph

Graph learning under sparsity priors

Analysing the Role of Social Visits on Migrants’ Social Capital: A Personal Network Approach

Decreased integration and information capacity in stroke measured by whole brain models of resting state activity

LUT Mapping and Optimization for Majority-Inverter Graphs

Constant Factor Approximation for ATSP with Two Edge Weights

From data to structures

AiiDA: automated interactive infrastructure and database for computational science

Boolean logic optimization in majority-inverter graphs

Simple topological graphs

Disjoint edges in topological graphs and the tangled-thrackle conjecture

Graph Chatbot

Chat with Graph Search

Analysing the Role of Social Visits on Migrants’ Social Capital: A Personal Network Approach

Graph learning under sparsity priors

Decreased integration and information capacity in stroke measured by whole brain models of resting state activity

LUT Mapping and Optimization for Majority-Inverter Graphs

Boolean logic optimization in majority-inverter graphs

Simple topological graphs

From data to structures

AiiDA: automated interactive infrastructure and database for computational science

Constant Factor Approximation for ATSP with Two Edge Weights

Disjoint edges in topological graphs and the tangled-thrackle conjecture