1593 search results - page 2 / 319 » The Complexity of Computing the Size of an Interval |
EOR
2002
13 years 5 months ago
2002
The paper analyzes the criticality in a network with interval activities duration times. A natural generalization of the criticality notion (for a path, an activity and an event) ...
WG
1992
Springer
13 years 9 months ago
1992
Springer
The recognition complexityof ordered set properties is considered, i.e.how many questions have to be asked to decide if an unknown ordered set has a prescribed property. We prove ...
CORR
2010
Springer
13 years 4 months ago
2010
Springer
The exact computation of orbits of discrete dynamical systems on the interval is considered. Therefore, a multiple-precision floating point approach based on error analysis is ch...
WG
2009
Springer
14 years 2 days ago
2009
Springer
We present a fully dynamic algorithm that maintains three different representations of an interval graph: a minimal interval model of the graph, the PQ-tree of its maximal cliques...
STOC
1987
ACM
13 years 9 months ago
1987
ACM