✦ LIBER ✦

A note on perfect Gaussian elimination

✍ Scribed by Martin Charles Golumbic

Publisher: Elsevier Science
Year: 1978
Tongue: English
Weight: 133 KB
Volume: 64
Category: Article
ISSN: 0022-247X
DOI: 10.1016/0022-247x(78)90053-7

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A note on pivot size in Gaussian elimina

A note on pivot size in Gaussian elimination

✍ A.M. Cohen 📂 Article 📅 1974 🏛 Elsevier Science 🌐 English ⚖ 295 KB

A Note on Perfect Isometries

✍ Geoffrey R. Robinson 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 94 KB

## Ž . B which take constant non-zero ¨alues on p-singular elements. 1 Furthermore, it is always possible to modify the perfect isometry so that it sends the trivial character of H to the trivial character of G.

A note on perfect orders

✍ C.T. Hoáng; N.V.R. Mahadev 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 852 KB

Perfectly orderable graphs were introduced by Chvfital in 1984. Since then, several classes of perfectly orderable graphs have been identified. In this paper, we establish three new results on perfectly orderable graphs. First, we prove that every graph with Dilworth number at most three has a simpl

A note on Ki-perfect graphs

✍ Jason I. Brown; Derek G. Corneil; A. Ridha Mahjoub 📂 Article 📅 1990 🏛 John Wiley and Sons 🌐 English ⚖ 348 KB

## Abstract __Ki__‐perfect graphs are a special instance of __F ‐ G__ perfect graphs, where __F__ and __G__ are fixed graphs with __F__ a partial subgraph of __G.__ Given __S__, a collection of __G__‐subgraphs of graph __K__, an __F ‐ G__ cover of __S__ is a set of __T__ of __F__‐subgraphs of __K__

A note on path-perfect graphs

✍ John Frederick Fink; H.Joseph Straight 📂 Article 📅 1981 🏛 Elsevier Science 🌐 English ⚖ 498 KB

In this paper we explore the c:oncept of factoring a graph into non-isomorphic paths. Lel Pi denote the path of length i. We SAY that a graph G having $n(n + 1) edges is path-perfect if E( G) can be partitioned as E, UE, !J l \* l U & such that the subgraph of G induced by 32i is isomorphic to Pr, f

A Multigrid Method Based on Incomplete G

A Multigrid Method Based on Incomplete Gaussian Elimination

✍ Arnold Reusken 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 897 KB

In this paper we introduce and analyse a new Schur complement approximation based on incomplete Gaussian elimination. The approximate Schur complement is used to develop a multigrid method. This multigrid method has an algorithmic structure that is very similar to the algorithmic structure of classi