✦ LIBER ✦

An algorithm for finding block-triangular forms

✍ Scribed by Erik Dietzenbacher

Publisher: Elsevier Science
Year: 1996
Tongue: English
Weight: 461 KB
Volume: 76
Category: Article
ISSN: 0096-3003
DOI: 10.1016/0096-3003(95)00157-3

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Explicit Jordan form for certain block t

Explicit Jordan form for certain block triangular matrices

✍ Charles R. Johnson; Erik A. Schreiner 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 870 KB

Explicit Jordan form for certain block t

Explicit Jordan form for certain block triangular matrices. II

✍ Charles R. Johnson; Erik A. Schreiner 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 687 KB

An algorithm for finding closed curves

✍ Ming Xie; Monique Thonnat 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 900 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

An Algorithm for Finding the Causal Dist

An Algorithm for Finding the Causal Distributed Breakpoint

✍ Toshimitsu Masuzawa; Nobuki Tokura 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 137 KB

An adaptive algorithm for finding a cove

An adaptive algorithm for finding a covering hypersphere

✍ S.J. Wan; S.K.M. Wong 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 472 KB