5100 search results - page 306 / 1020 » The Linear Complexity of a Graph |
208
click to vote
ESA
2003
Springer
16 years 6 hour ago
2003
Springer
We propose a new complexity measure for movement of objects, the smoothed motion complexity. Many applications are based on algorithms dealing with moving objects, but usually data...
193
Voted
TCS
2008
15 years 6 months ago
2008
Finding, counting and/or listing triangles (three vertices with three edges) in massive graphs are natural fundamental problems, which received recently much attention because of ...
201
click to vote
TCS
2011
15 years 1 months ago
2011
Let F be a cellular automaton (CA). This paper establishes necessary conditions for F in order to be intrinsically universal. The central idea is to consider the communication com...
159
click to vote
ICRA
1999
IEEE
15 years 11 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...
160
click to vote
WG
1995
Springer
15 years 10 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...