✦ LIBER ✦

An O(n2) algorithm for the maximum cycle mean of an n×n bivalent matrix

✍ Scribed by P. Butkovic; R.A. Cuninghame-Green

Publisher: Elsevier Science
Year: 1992
Tongue: English
Weight: 503 KB
Volume: 35
Category: Article
ISSN: 0166-218X
DOI: 10.1016/0166-218x(92)90039-d

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The maximum determinant of an n × n lowe

The maximum determinant of an n × n lower Hessenberg (0, 1) matrix

✍ Li Ching 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 229 KB

An O(n2) Algorithm for Undirected Split

An O(n2) Algorithm for Undirected Split Decomposition

✍ T.H. Ma; J. Spinrad 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 654 KB

An O(n log n) algorithm for the convex b

An O(n log n) algorithm for the convex bipartite matching problem

✍ G. Gallo 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 197 KB

An O(n) time algorithm for maximum match

An O(n) time algorithm for maximum matching in P4-tidy graphs

✍ J.L. Fouquet; I. Parfenoff; H. Thuillier 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 630 KB

The A-tidy graphs were introduced by I. Rusu to generalize some already known classes of graphs with "few" induced P4 s. In this paper, we extend to PA-tidy graphs a linear time algorithm of C.-H. Yang and M.-S. Yu for finding a maximum matching in a cograph G (given a parse tree associated to G). @

An O(n-log-log-n) Time Algorithm for Con

An O(n-log-log-n) Time Algorithm for Constructing a Graph of Maximum Connectivity with Prescribed Degrees

✍ T. Asano 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 601 KB

An O(N2) algorithm for coloring perfect

An O(N2) algorithm for coloring perfect planar graphs

✍ Alan Tucker; Donna Wilson 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 501 KB