2294 search results - page 365 / 459 » From Path Graphs to Directed Path Graphs |
154
Voted
ESA
2009
Springer
15 years 10 months ago
2009
Springer
In this paper, we introduce the bounded budget betweenness centrality game, a strategic network formation game in which nodes build connections subject to a budget constraint in or...
128
click to vote
SIGMETRICS
2006
ACM
15 years 10 months ago
2006
ACM
This work analyzes the connectivity of large diameter networks where every link has an independent probability p of failure. We give a (relatively simple) topological condition th...
138
click to vote
ECMDAFA
2005
Springer
15 years 9 months ago
2005
Springer
This article presents a control flow analysis methodology based on UML 2.0 sequence diagrams (SD). In contrast to the conventional code-based control flow analysis techniques, thi...
111
click to vote
FOCS
2003
IEEE
15 years 9 months ago
2003
IEEE
In this paper, we give the rst constant-factor approximationalgorithmfor the rooted Orienteering problem, as well as a new problem that we call the Discounted-Reward TSP, motivate...
154
click to vote
CCCG
2008
15 years 5 months ago
2008
We consider planning optimal collision-free motions of two polygonal robots under translation. Each robot has a reference point that must lie on a given graph, called a roadmap, w...