2125 search results - page 206 / 425 » On Graph Complexity |
141
click to vote
LICS
2008
IEEE
16 years 27 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...
171
click to vote
ICALP
2007
Springer
16 years 20 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...
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 ...
140
click to vote
UAI
2004
15 years 7 months ago
2004
The complexity of a reasoning task over a graphical model is tied to the induced width of the underlying graph. It is well-known that the conditioning (assigning values) on a subs...
139
click to vote
LATIN
1998
Springer
15 years 10 months ago
1998
Springer
The problem of approximate pattern matching on hypertext is de ned and solved by Amir et al. in O(m(nlogm + e)) time, where m is the length of the pattern, n is the total text size...