✦ LIBER ✦

Optimal Assignments for Consecutive-2 Graphs

✍ Scribed by Du, D. Z.; Hwang, F. K.

Book ID: 118212530
Publisher: Society for Industrial and Applied Mathematics
Year: 1987
Weight: 793 KB
Volume: 8
Category: Article
ISSN: 0196-5212
DOI: 10.1137/0608042

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

ON PRIMITIVE GRAPHS AND OPTIMAL VERTEX A

ON PRIMITIVE GRAPHS AND OPTIMAL VERTEX ASSIGNMENTS

✍ R. L. Graham 📂 Article 📅 1970 🏛 John Wiley and Sons 🌐 English ⚖ 576 KB

Optimal I-Intersection assignments for g

Optimal I-Intersection assignments for graphs: A linear programming approach

✍ Robert J. Opsut; Fred S. Roberts 📂 Article 📅 1983 🏛 John Wiley and Sons 🌐 English ⚖ 409 KB

An intersection assignment for a graph is the assignment of a set t o each vertex so that edges correspond to pairs of sets which overlap. Intersection assignments are studied in which each set is a real interval, perhaps of specified minimum length. In particular, linear programming methods are use

2-Role assignments on triangulated graph

2-Role assignments on triangulated graphs

✍ Li Sheng 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 267 KB

If G is a graph, a k-role assignment is a function mapping each vertex into a role, a positive integer 1; 2; : : : ; k, so that if x and y have the same role, then the sets of roles assigned to their neighbors are the same. A graph is called a triangulated graph if it contains no chord-less cycle of

Enumerating Consecutive and Nested Parti

Enumerating Consecutive and Nested Partitions for Graphs

✍ F.K. Hwang; G.J. Chang 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 116 KB

Consecutive and nested partitions have been extensively studied in the set-partition problem as tools with which to search efficiently for an optimal partition. We extend the study of consecutive and nested partitions on a set of integers to the vertex-set of a graph. A subset of vertices is conside

Optimal integer delay-budget assignment

Optimal integer delay-budget assignment on directed acyclic graphs

✍ Bozorgzadeh, E.; Ghiasi, S.; Takahashi, A.; Sarrafzadeh, M. 📂 Article 📅 2004 🏛 IEEE 🌐 English ⚖ 722 KB

Computing optimal assignments for residu

Computing optimal assignments for residual network reliability

✍ C. Stivaros; K. Sutner 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 701 KB

We study the problem of assigning given failure probabilities to the nodes of a network so as to optimize its reliability. The measure used is the residual node connectedness reliability of the network, which is defined as the probability that the operating nodes are connected. In this paper. we sho