✦ LIBER ✦

A note on bipartite graphs and pivot selection in sparse matrices

✍ Scribed by Sangiovanni-Vincentelli, A.

Book ID: 117913753
Publisher: IEEE
Year: 1976
Weight: 582 KB
Volume: 23
Category: Article
ISSN: 0098-4094
DOI: 10.1109/tcs.1976.1084160

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Pivot selection and row ordering in give

Pivot selection and row ordering in givens reduction on sparse matrices

✍ I. S. Duff 📂 Article 📅 1974 🏛 Springer Vienna 🌐 English ⚖ 514 KB

A Note on Fill for Sparse Matrices

✍ George, Alan; Liu, Wai-Hung 📂 Article 📅 1975 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 391 KB

A note on bipartite subgraphs of triangl

A note on bipartite subgraphs of triangle-free regular graphs

✍ S. C. Locke 📂 Article 📅 1990 🏛 John Wiley and Sons 🌐 English ⚖ 130 KB 👁 2 views

## Abstract Lower bounds on the size of a maximum bipartite subgraph of a triangle‐free __r__‐regular graph are presented.

Minimal triangulation of a graph and opt

Minimal triangulation of a graph and optimal pivoting order in a sparse matrix

✍ Tatsuo Ohtsuki; Lap Kit Cheung; Toshio Fujisawa 📂 Article 📅 1976 🏛 Elsevier Science 🌐 English ⚖ 596 KB

A note on a generalization of eigenvecto

A note on a generalization of eigenvector centrality for bipartite graphs and applications

✍ Peteris Daugulis 📂 Article 📅 2011 🏛 John Wiley and Sons 🌐 English ⚖ 88 KB

A note on packing trees into complete bi

A note on packing trees into complete bipartite graphs and on fishburn's conjecture

✍ Y. Caro; Y. Rodity 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 212 KB

In this note we improve significantly the result appeared in [4] by showing that any sequence of trees { T2, 'I;, . , T,} can be packed into the complete bipartite graph K,\_,,n,z (n even) for f = 0.3n. Furthermore we support Fishburn's Conjecture [2] by showing that any sequence {T,, T4,