Publications related to Path (graph theory)

Microsimulation Framework for Urban Price-Taker Markets

In the context of integrated transportation and other urban engineering infrastructure systems, there are many examples of markets, where consumers exhibit price-taking behaviour. While this behaviour is ubiquitous, the underlying mechanism can be captured ...

2011

Microsimulation Framework for Urban Price-Taker Markets

Bilal Farooq

In the context of integrated transportation and other urban engineering infrastructure systems, there are many examples of markets, where consumers exhibit price-taking behaviour. While this behaviour is ubiquitous, the underlying mechanism can be captured ...

2011

Chebyshev polynomial approximation for transductive learning on graphs

Nathanaël Perraudin

The goal of transductive learning is to find a way to recover the labels of lots of data with only a few known samples. In this work, we will work on graphs for two reasons. First, it’s possible to construct a graph from a given dataset with features. The ...

2011

The impact of mobility on the time complexity for deterministic broadcasting in radio networks

André Schiper, David Cavin, Yoav Sasson

We study the time complexity for deterministic broadcasting algorithms in mobile radio networks. The broadcast operation consists of a source node successfully communicating its message to every other node. In multi-hop radio networks such as MANETs, the m ...

2011

Multiple Object Tracking using K-Shortest Paths Optimization

Pascal Fua, François Fleuret, Engin Türetken, Jérôme Berclaz

Multi-object tracking can be achieved by detecting objects in individual frames and then linking detections across frames. Such an approach can be made very robust to the occasional detection failure: If an object is not detected in a frame but is in previ ...

Institute of Electrical and Electronics Engineers2011

Scalable Routing Easy as PIE: a Practical Isometric Embedding Protocol

Patrick Thiran, Julien Pierre Sacha Herzen

We present PIE, a scalable routing scheme that achieves 100% packet delivery and low path stretch. It is easy to implement in a distributed fashion and works well when costs are associated to links. Scalability is achieved by using virtual coordinates in a ...

Ieee Service Center, 445 Hoes Lane, Po Box 1331, Piscataway, Nj 08855-1331 Usa2011

Local Graph-based Distributed Control for Safe Highway Platooning

Alcherio Martinoli, Sven Adrian Gowal, Riccardo Falconi

Using graph theory, this paper investigates how a group of vehicles, endowed with local positioning capabilities (range and bearing to other vehicles), can keep a predefined formation. We propose a longitudinal and lateral controller that stabilizes a syst ...

Ieee Service Center, 445 Hoes Lane, Po Box 1331, Piscataway, Nj 08855-1331 Usa2010

Graph based distributed control of non-holonomic vehicles endowed with local positioning information engaged in escorting missions

Alcherio Martinoli, Sven Adrian Gowal, Riccardo Falconi

Using graph theory, this paper investigates how a group of robots, endowed with local positioning (range and bearing from other robots), can be engaged in a leader- following mission whilst keeping a predefined configuration. The possibility to locally cha ...

IEEE2010

An Improved LP-based Approximation for Steiner Tree

Thomas Rothvoss, Laura Sanità

The Steiner tree problem is one of the most fundamental

\mathbf{NP}

-hard problems: given a weighted undirected graph and a subset of terminal nodes, find a minimum-cost tree spanning the terminals. In a sequence of papers, the approximation ratio for thi ...

Acm Order Department, P O Box 64145, Baltimore, Md 21264 Usa2010

Oriented paths in n-chromatic digraphs

Rajai Nasser

In this thesis, we try to treat the problem of oriented paths in n-chromatic digraphs. We first treat the case of antidirected paths in 5-chromatic digraphs, where we explain El-Sahili’s theorem and provide an elementary and shorter proof of it. We then tr ...

2010

Path (graph theory)

Graph Chatbot

Chat with Graph Search

Microsimulation Framework for Urban Price-Taker Markets

Microsimulation Framework for Urban Price-Taker Markets

Chebyshev polynomial approximation for transductive learning on graphs

The impact of mobility on the time complexity for deterministic broadcasting in radio networks

Multiple Object Tracking using K-Shortest Paths Optimization

Scalable Routing Easy as PIE: a Practical Isometric Embedding Protocol

Local Graph-based Distributed Control for Safe Highway Platooning

Graph based distributed control of non-holonomic vehicles endowed with local positioning information engaged in escorting missions

An Improved LP-based Approximation for Steiner Tree

Oriented paths in n-chromatic digraphs

Microsimulation Framework for Urban Price-Taker Markets

An Improved LP-based Approximation for Steiner Tree

Microsimulation Framework for Urban Price-Taker Markets

The impact of mobility on the time complexity for deterministic broadcasting in radio networks

Chebyshev polynomial approximation for transductive learning on graphs

Multiple Object Tracking using K-Shortest Paths Optimization

Scalable Routing Easy as PIE: a Practical Isometric Embedding Protocol

Local Graph-based Distributed Control for Safe Highway Platooning

Graph based distributed control of non-holonomic vehicles endowed with local positioning information engaged in escorting missions

Oriented paths in n-chromatic digraphs