5100 search results - page 95 / 1020 » The Linear Complexity of a Graph |
CGO
2007
IEEE
14 years 3 months ago
2007
IEEE
Memory transfers are becoming more important to optimize, for both performance and power consumption. With this goal in mind, new register allocation schemes are developed, which ...
STOC
2006
ACM
14 years 9 months ago
2006
ACM
Classes of graphs with bounded expansion have been introduced in [15], [12]. They generalize both proper minor closed classes and classes with bounded degree. For any class with b...
SIAMDM
2008
13 years 7 months ago
2008
Recently lexicographic breadth first search (LexBFS) has been shown to be a very powerful tool for the development of linear time, easily implementable recognition algorithms for v...
SEMWEB
2005
Springer
14 years 2 months ago
2005
Springer
This paper extends the model theory of RDF with rules, placing an emphasis on integration with OWL and decidability of entailstart from an abstract syntax that views a rule as a pa...
CORR
2011
Springer
13 years 4 months ago
2011
Springer
—The subject of this work is the patrolling of an environment with the aid of a team of autonomous agents. We consider both the design of open-loop trajectories with optimal prop...