2612 search results - page 351 / 523 » Switching Graphs and Their Complexity |
175
click to vote
CGF
2011
14 years 8 months ago
2011
We introduce a fully automatic algorithm which optimizes the high-level structure of a given quadrilateral mesh to achieve a coarser quadrangular base complex. Such a topological ...
142
click to vote
STOC
2004
ACM
16 years 4 months ago
2004
ACM
We prove an (lg n) cell-probe lower bound on maintaining connectivity in dynamic graphs, as well as a more general trade-off between updates and queries. Our bound holds even if t...
148
click to vote
AIRWEB
2009
Springer
15 years 11 months ago
2009
Springer
Spammers in social bookmarking systems try to mimick bookmarking behaviour of real users to gain the attention of other users or search engines. Several methods have been proposed...
133
click to vote
SIGCOMM
2009
ACM
15 years 11 months ago
2009
ACM
The analysis of social and technological networks has attracted a lot of attention as social networking applications and mobile sensing devices have given us a wealth of real data...
134
click to vote
ICNP
2007
IEEE
15 years 10 months ago
2007
IEEE
—Data structures representing directed graphs with edges labeled by symbols from a finite alphabet are used to implement packet processing algorithms used in a variety of network...