Publication

An algorithm for source location in directed graphs

2004
Journal Articles

Abstract

A polynomial time solution algorithm is described to find a smallest subset R of nodes of a directed graph D=(V,A) such that, for every node v in V-R, there are k edge-disjoint paths from R to v and there are l edge-disjoint paths from v to R.

Official source

Graph Chat

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.

An algorithm for source location in directed graphs

Chat with Graph Search

The Spectral Graph Wavelet Transform: Fundamental Theory and Fast Computation

An Optimal Algorithm for Stochastic Vertex Cover

Trading Prophets