Concept

Cycle (théorie des graphes)

Publications associées (91)

The Random Trip Model: Stability, Stationary Regime, and Perfect Simulation

We define ``random trip", a generic mobility model for random, independent node motions, which contains as special cases: the random waypoint on convex or non convex domains, random walk on torus, billiards, city section, space graph, intercity and other m ...

2006

A Multi-Criteria Message Forwarding Architecture for Wireless Sensor Networks

Ioannis Alagiannis, Manoussos Gavriil Athanassoulis

Wireless Sensor Networks (WSN) comprise a fast-developing research area with a vast spectrum of applications. A WSN design is influenced by many factors such as transmission errors, network topology and power consumption. Consequently, developing a WSN app ...

2005

Perfect Simulation and Stationarity of a Class of Mobility Models

Jean-Yves Le Boudec, Milan Vojnovic

We define ``random trip", a generic mobility model for independent mobiles that contains as special cases: the random waypoint on convex or non convex domains, random walk with reflection or wrapping, city section, space graph and other models. We use Palm ...

2005

An algorithm for source location in directed graphs

Johanna Kristin Maria Becker

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. ...

2004

On Average Throughput Benefits for Network Coding

Christina Fragouli, Emina Soljanin

We calculate the average throughput benefit that network coding can offer as compared to routing for different classes of multicast configurations over directed graphs. The averaging is over the throughput each individual receiver experiences. For the case ...

2004

Trust Evaluation in Ad-Hoc Networks

Georgios Theodorakopoulos

An important concept in network security is trust, interpreted as a relation among entities that participate in various protocols. Trust relations are based on evidence related to the previous interactions of entities within a protocol. In this work, we ar ...

ACM Press2004

Perfect Simulation and Stationarity of a Class of Mobility Models

Jean-Yves Le Boudec, Milan Vojnovic

2004

Using Directed Acyclic Graphs to Coordinate Propagation and Search for Numerical Constraint Satisfaction Problems

Xuan-Ha Vu

The pioneering paper by H. Schichl and A. Neumaier has founded the fundamentals of interval analysis on DAGs for global optimization, including a fundamental of constraint propagation. In this paper, we extend the constraint propagation technique for solvi ...

2004

Phylogenetic networks: modeling, reconstructibility, and accuracy

Bernard Moret, Tandy Warnow

Phylogenetic networks model the evolutionary history of sets of organisms when events such as hybrid speciation and horizontal gene transfer occur. In spite of their widely acknowledged importance in evolutionary biology, phylogenetic networks have so far ...

2004

Who links to whom: mining linkage between Web sites

Monika Henzinger

Previous studies of the Web graph structure have focused on the graph structure at the level of individual pages. In actuality the Web is a hierarchically nested graph, with domains, hosts and Web sites introducing intermediate levels of affiliation and ad ...

2001

Graph Chatbot

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.

Connectez-vous pour utiliser Chat avec Graph Search