Parametric Polynomial-Time Algorithms for Computing Response-Time Bounds for Static-Priority Tasks with Release Jitters

2007 ◽  
Author(s):  
Nathan Fisher ◽  
Thi Huyen Chau Nguyen ◽  
Joel Goossens ◽  
Pascal Richard
Keyword(s):  
Response Time ◽  
Polynomial Time ◽  
Polynomial Time Algorithms ◽  
Time Bounds

scholarly journals An Overview of Algorithms for Network Survivability

2012 ◽  
Vol 2012 ◽  
pp. 1-19 ◽  
Author(s):  
F. A. Kuipers
Keyword(s):  
Polynomial Time ◽  
Network Connectivity ◽  
Network Survivability ◽  
Disjoint Paths ◽  
Polynomial Time Algorithms ◽  
Concise Overview ◽  
Main Components

Network survivability—the ability to maintain operation when one or a few network components fail—is indispensable for present-day networks. In this paper, we characterize three main components in establishing network survivability for an existing network, namely, (1) determining network connectivity, (2) augmenting the network, and (3) finding disjoint paths. We present a concise overview of network survivability algorithms, where we focus on presenting a few polynomial-time algorithms that could be implemented by practitioners and give references to more involved algorithms.

scholarly journals Reconstruction of score sets

2014 ◽  
Vol 6 (2) ◽  
pp. 210-229
Author(s):  
Antal Iványi
Keyword(s):  
Polynomial Time ◽  
Constructive Proof ◽  
Construction Algorithm ◽  
Polynomial Time Algorithms ◽  
General Polynomial ◽  
Degree Set ◽  
New Algorithms

Abstract The score set of a tournament is defined as the set of its different outdegrees. In 1978 Reid [15] published the conjecture that for any set of nonnegative integers D there exists a tournament T whose degree set is D. Reid proved the conjecture for tournaments containing n = 1, 2, and 3 vertices. In 1986 Hager [4] published a constructive proof of the conjecture for n = 4 and 5 vertices. In 1989 Yao [18] presented an arithmetical proof of the conjecture, but general polynomial construction algorithm is not known. In [6] we described polynomial time algorithms which reconstruct the score sets containing only elements less than 7. In [5] we improved this bound to 9. In this paper we present and analyze new algorithms Hole-Map, Hole-Pairs, Hole-Max, Hole-Shift, Fill-All, Prefix-Deletion, and using them improve the above bound to 12, giving a constructive partial proof of Reid’s conjecture.

Sign in / Sign up

Export Citation Format

Share Document