Publications related to Path graph

The Role of Adaptivity in Source Identification with Time Queries

Understanding epidemic propagation in large networks is an important but challenging task, especially since we usually lack information, and the information that we have is often counter-intuitive. An illustrative example is the dependence of the final siz ...

EPFL2022

Vertex-Frequency Analysis on Graphs

Pierre Vandergheynst, Benjamin Ricaud, David Shuman

One of the key challenges in the area of signal processing on graphs is to design dictionaries and transform methods to identify and exploit structure in signals on weighted graphs. To do so, we need to account for the intrinsic geometric structure of the ...

Academic Press Inc Elsevier Science2016

A Windowed Graph Fourier Transform

Pierre Vandergheynst, Benjamin Ricaud, David Shuman

The prevalence of signals on weighted graphs is increasing; however, because of the irregular structure of weighted graphs, classical signal processing techniques cannot be directly applied to signals on graphs. In this paper, we define generalized transla ...

Ieee2012

A Windowed Graph Fourier Transform

Pierre Vandergheynst, Benjamin Ricaud, David Shuman

The prevalence of signals on weighted graphs is increasing; however, because of the irregular structure of weighted graphs, classical signal processing techniques cannot be directly applied to signals on graphs. In this paper, we define generalized transla ...

IEEE2012

Automated Reconstruction of Tree Structures using Path Classifiers and Mixed Integer Programming

Pascal Fua, Engin Türetken, Fethallah Benmansour

Although tracing linear structures in 2D images and 3D image stacks has received much attention over the years, full automation remains elusive. In this paper, we formulate the delineation problem as one of solving a Quadratic Mixed Integer Program (Q-MIP) ...

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

Primal-dual Approximation Algorithms for Node-Weighted Steiner Forest on Planar Graphs

Carsten Moldenhauer

NODE-WEIGHTED STEINER FOREST is the following problem: Given an undirected graph, a set of pairs of terminal vertices, a weight function on the vertices, find a minimum weight set of vertices that includes and connects each pair of terminals. We consider t ...

Academic Press Inc Elsevier Science2011

Characterizing Path Graphs by Forbidden Induced Subgraphs

A path graph is the intersection graph of subpaths of a tree. In 1970, Renz asked for a characterization of path graphs by forbidden induced subgraphs. We answer this question by determining the complete list of graphs that are not path graphs and are mini ...

2009

Path graph

The Role of Adaptivity in Source Identification with Time Queries

Vertex-Frequency Analysis on Graphs

A Windowed Graph Fourier Transform

A Windowed Graph Fourier Transform

Automated Reconstruction of Tree Structures using Path Classifiers and Mixed Integer Programming

Beyond Graphs: A New Synthesis

Primal-dual Approximation Algorithms for Node-Weighted Steiner Forest on Planar Graphs

Characterizing Path Graphs by Forbidden Induced Subgraphs

Graph Chatbot

Chat with Graph Search

The Role of Adaptivity in Source Identification with Time Queries

Vertex-Frequency Analysis on Graphs

A Windowed Graph Fourier Transform

Beyond Graphs: A New Synthesis

A Windowed Graph Fourier Transform

Characterizing Path Graphs by Forbidden Induced Subgraphs

Primal-dual Approximation Algorithms for Node-Weighted Steiner Forest on Planar Graphs

Automated Reconstruction of Tree Structures using Path Classifiers and Mixed Integer Programming