4865 search results - page 202 / 973 » The Complexity of Graph Connectivity |
178
click to vote
IMC
2010
ACM
15 years 1 months ago
2010
ACM
This paper presents a new approach to determine the geographical footprint of individual Autonomous Systems that directly provide service to end-users, i.e.,eyeball ASes. The key ...
129
click to vote
QSHINE
2005
IEEE
15 years 9 months ago
2005
IEEE
Protocols designed to provide error-free communications over lossy links, at both data link and transport layers, commonly employ the idea of sliding windows, which is based on th...
174
Voted
ICDM
2010
IEEE
15 years 1 months ago
2010
IEEE
Community detection is an important task for mining the structure and function of complex networks. Many pervious approaches are difficult to detect communities with arbitrary size...
146
click to vote
DAGSTUHL
2006
15 years 5 months ago
2006
Abstract. The Galois connection involving polymorphisms and coclones has received a lot of attention in regard to constraint satisfaction problems. However, it fails if we are inte...
130
click to vote
VLDB
1994
ACM
15 years 7 months ago
1994
ACM
Advanced technical applications like routing systems or electrical network managementsystems introduce the need for complex manipulations of large size graphs. Efficiently support...