✦ LIBER ✦

Algorithms for parsimonious complete sets in directed graphs

✍ Scribed by Avraham A. Melkman; Solomon E. Shimony

Book ID: 107766323
Publisher: Elsevier Science
Year: 1996
Tongue: English
Weight: 433 KB
Volume: 59
Category: Article
ISSN: 0020-0190
DOI: 10.1016/0020-0190(96)00123-8

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Combinatorial algorithms for feedback pr

Combinatorial algorithms for feedback problems in directed graphs

✍ Camil Demetrescu; Irene Finocchi 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 135 KB

Approximation Algorithms for Independent

Approximation Algorithms for Independent Sets in Map Graphs

✍ Zhi-Zhong Chen 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 172 KB

This paper presents polynomial-time approximation algorithms for the problem of computing a maximum independent set in a given map graph G with or without weights on its vertices. If G is given together with a map, then a ratio of 1 + δ can be achieved by a quadratic-time algorithm for any given con

Improved Dynamic Reachability Algorithms

Improved Dynamic Reachability Algorithms for Directed Graphs

✍ Roditty, Liam; Zwick, Uri 📂 Article 📅 2008 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 206 KB

Fast Fitch-Parsimony Algorithms for Larg

Fast Fitch-Parsimony Algorithms for Large Data Sets

✍ Fredrik Ronquist 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 306 KB

Fast Fitch-Parsimony Algorithms for Larg

Fast Fitch-Parsimony Algorithms for Large Data Sets

✍ Fredrik Ronquist 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 315 KB

Iterative algorithms for generating mini

Iterative algorithms for generating minimal cutsets in directed graphs

✍ D. R. Shier; D. E. Whited 📂 Article 📅 1986 🏛 John Wiley and Sons 🌐 English ⚖ 803 KB