4865 search results - page 267 / 973 » The Complexity of Graph Connectivity |
149
click to vote
CC
2006
Springer
15 years 6 months ago
2006
Springer
The sum of a coloring is the sum of the colors assigned to the vertices (assuming that the colors are positive integers). The sum (G) of graph G is the smallest sum that can be ach...
168
click to vote
STOC
2001
ACM
16 years 7 months ago
2001
ACM
We show that we can maintain up to polylogarithmic edge connectivity for a fully-dynamic graph in ~O(pn) time per edge insertion or deletion. Within logarithmic factors, this matc...
185
click to vote
CIKM
2009
Springer
16 years 1 months ago
2009
Springer
In recent years, the tourism assistance community is gradually shifting its emphasis to digital, interactive systems. Our project aims for digital tourism assistance by combining ...
143
click to vote
CSR
2009
Springer
16 years 1 months ago
2009
Springer
Muchnik’s theorem about simple conditional descriptions states that for all strings a and b there exists a short program p transforming a to b that has the least possible length ...
172
click to vote
IWPEC
2009
Springer
16 years 1 months ago
2009
Springer
We describe a framework for expressing the complexity of algorithms for FPT problems with two separate parameters k, m and with exponential time bounds O∗ (xk ym ) where x, y &g...