2503 search results - page 387 / 501 » A study of 3-arc graphs |
CORR
2008
Springer
13 years 10 months ago
2008
Springer
Abstract. We propose a number of techniques for learning a global ranking from data that may be incomplete and imbalanced -- characteristics that are almost universal to modern dat...
DM
2008
13 years 10 months ago
2008
For two graphs G and H, let the mixed anti-Ramsey numbers, maxR(n; G, H), (minR(n; G, H)) be the maximum (minimum) number of colors used in an edge-coloring of a complete graph wi...
CORR
2004
Springer
13 years 10 months ago
2004
Springer
Mapping the Internet generally consists in sampling the network from a limited set of sources by using traceroute-like probes. This methodology, akin to the merging of different s...
CORR
2011
Springer
13 years 5 months ago
2011
Springer
In this paper, we develop new methods for the analysis of decentralized control systems and we apply them to formation control problems. The basic set-up consists of a system with...
CORR
2011
Springer
13 years 5 months ago
2011
Springer
Abstract—Breadth First Search (BFS) is a widely used approach for sampling large unknown Internet topologies. Its main advantage over random walks and other exploration technique...