✦ LIBER ✦

Matrix Completions and Chordal Graphs

✍ Scribed by Kenneth John Harrison

Book ID: 106277460
Publisher: Institute of Mathematics, Chinese Academy of Sciences and Chinese Mathematical Society
Year: 2003
Tongue: English
Weight: 237 KB
Volume: 19
Category: Article
ISSN: 1439-7617
DOI: 10.1007/s10114-003-0266-2

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Positive semidefinite matrix completions

Positive semidefinite matrix completions on chordal graphs and constraint nondegeneracy in semidefinite programming

✍ Houduo Qi 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 179 KB

Let G = (V , E) be a graph. In matrix completion theory, it is known that the following two conditions are equivalent: (i) G is a chordal graph; (ii) Every G-partial positive semidefinite matrix has a positive semidefinite matrix completion. In this paper, we relate these two conditions to constrain

Chordal Completions of Planar Graphs

✍ F.R.K. Chung; D. Mumford 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 431 KB

We prove that every planar graph on \(n\) vertices is contained in a chordal graph with at most \(c n \log n\) edges for some abolsute constant \(c\) and this is best possible to within a constant factor. 1994 Academic Press, Inc.

List matrix partitions of chordal graphs

✍ Tomás Feder; Pavol Hell; Sulamita Klein; Loana Tito Nogueira; Fábio Protti 📂 Article 📅 2005 🏛 Elsevier Science 🌐 English ⚖ 265 KB

Tractability of Parameterized Completion

Tractability of Parameterized Completion Problems on Chordal, Strongly Chordal, and Proper Interval Graphs

✍ Kaplan, Haim; Shamir, Ron; Tarjan, Robert E. 📂 Article 📅 1999 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 373 KB

Strongly chordal and chordal bipartite g

Strongly chordal and chordal bipartite graphs are

✍ Pinar Heggernes; Federico Mancini; Charis Papadopoulos; R. Sritharan 📂 Article 📅 2010 🏛 Springer US 🌐 English ⚖ 634 KB

Chordal graphs, interval graphs, and wqo

✍ Ding, Guoli 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 240 KB 👁 1 views

Let be the induced-minor relation. It is shown that, for every t, all chordal graphs of clique number at most t are well-quasi-ordered by . On the other hand, if the bound on clique number is dropped, even the class of interval graphs is not well-quasi-ordered by .