Sciweavers

2294 search results - page 8 / 459
» From Path Graphs to Directed Path Graphs
Sort
View
CORR
2008
Springer
120views Education» more  CORR 2008»
13 years 9 months ago
Menger's Paths with Minimum Mergings
For an acyclic directed graph with multiple sources and multiple sinks, we prove that one can choose the Menger's paths between the sources and the sinks such that the number...
Guangyue Han
SIAMDM
2010
99views more  SIAMDM 2010»
13 years 3 months ago
On the Stable Paths Problem
The Border Gateway Protocol (BGP) is the interdomain routing protocol used to exchange routing information between Autonomous Systems (ASes) in the internet today. While intradoma...
Penny E. Haxell, Gordon T. Wilfong
ICNP
2000
IEEE
14 years 1 months ago
Convergent Multi-Path Routing
We present a protocol for maintaining multiple paths to each destination in a network of processes. For each destination, each process in the network maintains a set of neighbors ...
Jorge Arturo Cobb
CORR
2007
Springer
116views Education» more  CORR 2007»
13 years 9 months ago
Complexity of some Path Problems in DAGs and Linear Orders
We investigate here the computational complexity of three natural problems in directed acyclic graphs. We prove their NP Completeness and consider their restrictions to linear orde...
Serge Burckel
ICPR
2010
IEEE
14 years 9 days ago
Kernel on Graphs Based on Dictionary of Paths for Image Retrieval
Recent approaches of graph comparison consider graphs as sets of paths [6, 5]. Kernels on graphs are then computed from kernels on paths. A common strategy for graph retrieval is ...
Jean-Emmanuel Haugeard, Sylvie Philipp-Foliguet, P...