270 search results - page 19 / 54 » Properties of Almost All Graphs and Generalized Quantifiers |
MICS
2010
13 years 2 months ago
2010
In this paper we consider the k-fixed-endpoint path cover problem on proper interval graphs, which is a generalization of the path cover problem. Given a graph G and a set T of k v...
IPSN
2010
Springer
14 years 2 months ago
2010
Springer
We study the utility of dynamic frequency agility in realworld wireless sensor networks. Many view such agility as essential to obtaining adequate reliability in industrial enviro...
ESA
2010
Springer
13 years 8 months ago
2010
Springer
Abstract. Possibly the most famous algorithmic meta-theorem is Courcelle's theorem, which states that all MSO-expressible graph properties are decidable in linear time for gra...
STACS
1999
Springer
13 years 11 months ago
1999
Springer
Leo Harrington surprisingly constructed a machine which can learn any computable function f according to the following criterion (called Bc∗ -identification). His machine, on t...
CONEXT
2009
ACM
13 years 8 months ago
2009
ACM
Network traffic can be represented by a Traffic Dispersion Graph (TDG) that contains an edge between two nodes that send a particular type of traffic (e.g., DNS) to one another. T...