A spectral lower bound for the treewidth of a graph and its consequences

Chandran, L. Sunil; Subramanian, C. R.

アイテム詳細

登録内容を編集ファイル形式で保存

一時保存へ追加

タグ情報を表示リリース履歴を表示詳細要約

公開

学術論文

A spectral lower bound for the treewidth of a graph and its consequences

MPS-Authors

Chandran, L. Sunil
Max Planck Society;

/persons/resource/persons45571

Subramanian, C. R.
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

External Resource

There are no locators available

Fulltext (restricted access)

There are currently no full texts shared for your IP range.

フルテキスト (公開)

公開されているフルテキストはありません

付随資料 (公開)

There is no public supplementary material available

引用

Chandran, L. S., & Subramanian, C. R. (2003). A spectral lower bound for the treewidth of a graph and its consequences. Information Processing Letters, 87, 195-200.

引用: https://hdl.handle.net/11858/00-001M-0000-000F-2C4B-A

要旨

要旨はありません