2612 search results - page 264 / 523 » Switching Graphs and Their Complexity |
244
click to vote
ALGORITHMICA
2011
15 years 1 months ago
2011
Let G = (V, E, w) be a directed graph, where w : V → R is an arbitrary weight function defined on its vertices. The bottleneck weight, or the capacity, of a path is the smalles...
142
click to vote
LICS
2008
IEEE
16 years 29 days ago
2008
IEEE
The question of whether there is a logic that captures polynomial time is the central open problem in descriptive complexity theory. In my talk, I will review the question and the...
173
click to vote
ICALP
2007
Springer
16 years 22 days ago
2007
Springer
Abstract. We give an fpt approximation algorithm for the directed vertex disjoint cycle problem. Given a directed graph G with n vertices and a positive integer k, the algorithm co...
144
click to vote
DIAL
2006
IEEE
16 years 19 days ago
2006
IEEE
It is an important topic for segmentation on how to merge the over-segmented subimages of characters into integral characters. The conventional character segmentation has been mos...
160
click to vote
APVIS
2007
15 years 8 months ago
2007
In this paper, we present a case study for the visualisation and analysis of large and complex temporal multivariate networks derived from the Internet Movie DataBase (IMDB). Our ...