9842 search results - page 63 / 1969 » Problem complexity |
112
click to vote
COCO
2000
Springer
15 years 5 months ago
2000
Springer
We consider the problem of testing whether the intersection of a collection of k automata is empty. The straightforward algorithm for solving this problem runs in time k where is...
115
click to vote
TCS
2010
14 years 8 months ago
2010
In this paper we show that the problem of finding a chordless path between a vertex s and a vertex t containing a vertex v remains NP-complete in bipartite graphs, thereby strengt...
130
click to vote
FCT
2007
Springer
15 years 3 months ago
2007
Springer
The diameter of an undirected graph is the minimal number d such that there is a path between any two vertices of the graph of length at most d. The radius of a graph is the minim...
132
click to vote
COMPGEOM
2005
ACM
15 years 4 months ago
2005
ACM
Using inclusion-exclusion, we can write the indicator function of a union of finitely many balls as an alternating sum of indicator functions of common intersections of balls. We...
AIPS
2008
15 years 4 months ago
2008
We present a complex scheduling problem where we want to plan meetings between customers and exhibitors at a trade event. One cause of the complexity of the problem is the general...