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

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

Local TagsRelease HistoryDetailsSummary

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

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.

Item is Released

show all hide all

Basic

show hide

Item Permalink: https://hdl.handle.net/11858/00-001M-0000-000F-2C4B-A Version Permalink: https://hdl.handle.net/11858/00-001M-0000-000F-2C4C-8

Genre: Journal Article

Files

show Files

Locators

show

Creators

show

hide

Creators:
Chandran, L. Sunil¹, Author
Subramanian, C. R.², Author

Affiliations:
1Max Planck Society, ou_persistent13
2Algorithms and Complexity, MPI for Informatics, Max Planck Society, ou_24019

Content

show

Details

show

hide

Language(s): eng - English

Dates: Modified: 2004-07-06Date issued: 2003

Publication Status: Issued

Pages: -

Publishing info: -

Table of Contents: -

Rev. Type: Peer

Identifiers: eDoc: 202035
Other: Local-ID: C1256BDD00205AD6-C3F45FA420A46390C1256E1600429336-IPL2003

Degree: -

Event

show

Legal Case

show

Project information

show

Source 1

show

hide

Title: Information Processing Letters

Source Genre: Journal

Creator(s):

Affiliations:

Publ. Info: -

Pages: - Volume / Issue: 87 Sequence Number: - Start / End Page: 195 - 200 Identifier: ISSN: 0020-1090