1201 search results - page 105 / 241 » Linear Probing and Graphs |
118
click to vote
IMC
2010
ACM
14 years 10 months ago
2010
ACM
The Internet topology data collected through traceroute exploration has been extensively studied in the past. In particular, a remarkable property of the Internet, the power-law s...
99
Voted
ICRA
1999
IEEE
15 years 5 months ago
1999
IEEE
We consider the robot exploration of a planar graphlike world. The robot's goal is to build a complete map of its environment. The environment is modeled as an arbitrary undi...
WG
1995
Springer
15 years 4 months ago
1995
Springer
Abstract. In this paper, we investigate which processor networks allow klabel Interval Routing Schemes, under the assumption that costs of edges may vary. We show that for each xed...
131
click to vote
ALGORITHMICA
2008
15 years 29 days ago
2008
The profile of a graph is an integer-valued parameter defined via vertex orderings; it is known that the profile of a graph equals the smallest number of edges of an interval supe...
129
Voted
TCS
2010
14 years 11 months ago
2010
: We study a variant of the path cover problem, namely, the k-fixed-endpoint path cover problem, or kPC for short. Given a graph G and a subset T of k vertices of V (G), a k-fixe...