✦ LIBER ✦

An algorithm for finding homogeneous pairs

✍ Scribed by Hazel Everett; Sulamita Klein; Bruce Reed

Publisher: Elsevier Science
Year: 1997
Tongue: English
Weight: 631 KB
Volume: 72
Category: Article
ISSN: 0166-218X
DOI: 10.1016/0166-218x(95)00090-e

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An efficient algorithm for finding a two

An efficient algorithm for finding a two-pair, and its applications

✍ Srinivasa R. Arikati; C. Pandu Rangan 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 190 KB

An algorithm for finding closed curves

✍ Ming Xie; Monique Thonnat 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 900 KB

An algorithm for finding block-triangula

An algorithm for finding block-triangular forms

✍ Erik Dietzenbacher 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 461 KB

An efficient algorithm for finding ideal

An efficient algorithm for finding ideal schedules

✍ Edward G. Coffman; Dariusz Dereniowski; Wiesław Kubiak 📂 Article 📅 2011 🏛 Springer-Verlag 🌐 English ⚖ 368 KB

An attack-finding algorithm for security

An attack-finding algorithm for security protocols

✍ Dongxi Liu; Xiaoyong Li; Yingcai Bai 📂 Article 📅 2002 🏛 Springer 🌐 English ⚖ 940 KB

An algorithm for finding factorizations

An algorithm for finding factorizations of complete graphs

✍ A. J. W. Hilton; Matthew Johnson 📂 Article 📅 2003 🏛 John Wiley and Sons 🌐 English ⚖ 58 KB 👁 1 views

## Abstract We show how to find a decomposition of the edge set of the complete graph into regular factors where the degree and edge‐connectivity of each factor is prescribed. © 2003 Wiley Periodicals, Inc. J Graph Theory 43: 132–136, 2003