Discrete Applied Mathematics, Volume 78
Volume 78, Number 1-3, October 1997
Srinivasa Rao Arikati, Anil Maheshwari, Christos D. Zaroliagis: Efficient Computation of Implicit Representations of Sparse Graphs. 1-16- Maw-Shang Chang, Chung-Chang Hsu: On Minimum Intersection of Two Minimum Dominating Sets of Interval Graphs. 41-50
- Peter C. Fishburn, Frank K. Hwang, Ding-Zhu Du, Biao Gao: On 1-rate Wide-sense Nonblocking for 3-stage Clos Networks. 75-87
- Pierre Hansen, Giovanni Storchi, Tsevi Vovor: Paths with Minimum Range and Ratio of Arc Lengths. 89-102
- Toru Hasunuma, Yukio Shibata: Embedding De Bruijn, Kautz and Shuffle-exchange Networks in Books. 103-116
- Kevin I.-J. Ho, Joseph Y.-T. Leung, W.-D. Wei: Scheduling Imprecise Computation Tasks with 0/1-constraint. 117-132
- Gyula Y. Katona: Edge Disjoint Polyp Packing. 133-152
- Suh-Ryung Kim, Fred S. Roberts: Competition Numbers of Graphs with a Small Number of Triangles. 153-162
- Haiko Müller: Recognizing Interval Digraphs and Interval Bigraphs in Polynomial Time. 189-205
- Madan Natu, Shu-Cherng Fang: The Point-to-point Connection Problem - Analysis and Algorithms. 207-226
- Jing-Ho Yan, Gerard J. Chang, Sandra Mitchell Hedetniemi, Stephen T. Hedetniemi: k-Path Partitions in Trees. 227-233
- Joost P. Warners, Tamás Terlaky, Cornelis Roos, Benjamin Jansen: A Potential Reduction Approach to the Frequency Assignment Problem. 251-282
- Ryan B. Hayward: Meyniel Weakly Triangulated Graphs II: A Theorem of Dirac. 283-289
- Wing Ning Li: Two-segmented Channel Routing Is Strong NP-complete. 291-298
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-06-18T214307 by the dblp team