✦ LIBER ✦

Efficient labelling algorithms for the maximum noncrossing matching problem

✍ Scribed by Federico Malucelli; Thomas Ottmann; Daniele Pretolani

Publisher: Elsevier Science
Year: 1993
Tongue: English
Weight: 336 KB
Volume: 47
Category: Article
ISSN: 0166-218X
DOI: 10.1016/0166-218x(93)90090-b

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Efficient Algorithms for the Maximum Sub

Efficient Algorithms for the Maximum Subarray Problem by Distance Matrix Multiplication

✍ Tadao Takaoka 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 222 KB

An efficient algorithm for some tree mat

An efficient algorithm for some tree matching problems

✍ Fabrizio Luccio; Linda Pagli 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 788 KB

An Efficient Parallel Algorithm for Maxi

An Efficient Parallel Algorithm for Maximum Matching for Some Classes of Graphs

✍ I. Parfenoff 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 403 KB

The P 4 -tidy graphs were introduced by I. Rusu to generalize some already known classes of graphs with few induced P 4 (cographs, P 4 -sparse graphs, P 4 -lite graphs). Here, we propose an extension of R. Lin and S. Olariu's work (1994. J. Parallel Distributed Computing 22, 26 36.) on cographs, usi

Fast algorithms for the maximum convolut

Fast algorithms for the maximum convolution problem

✍ Michael Bussieck; Hannes Hassler; Gerhard J. Woeginger; Uwe T. Zimmermann 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 487 KB

Decomposition algorithms for the maximum

Decomposition algorithms for the maximum-weight connected graph problem

✍ Heungsoon Felix Lee; Daniel R. Dooly 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 213 KB 👁 1 views

On the maximum capacity augmentation alg

On the maximum capacity augmentation algorithm for the maximum flow problem

✍ Donald Goldfarb; Jianxiu Hao 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 489 KB