1736 search results - page 73 / 348 » The rank-width of Directed Graphs |
110
Voted
SIAMCOMP
2010
15 years 2 months ago
2010
Designing and deploying a network protocol determines the rules by which end users interact with each other and with the network. We consider the problem of designing a protocol t...
141
Voted
CORR
2011
Springer
14 years 11 months ago
2011
Springer
We consider a consensus algorithm in which every node in a time-varying undirected connected graph assigns equal weight to each of its neighbors. Under the assumption that the deg...
147
click to vote
PVLDB
2010
14 years 10 months ago
2010
The growing demand for large-scale data mining and data analysis applications has led both industry and academia to design new types of highly scalable data-intensive computing pl...
194
click to vote
TMM
2010
14 years 10 months ago
2010
With the exponential growth of Web 2.0 applications, tags have been used extensively to describe the image contents on the Web. Due to the noisy and sparse nature in the human gene...
125
click to vote
CORR
2007
Springer
15 years 4 months ago
2007
Springer
An edge-colored directed graph is observable if an agent that moves along its edges is able to determine his position in the graph after a sufficiently long observation of the edge...