de.mpg.escidoc.pubman.appbase.FacesBean
English
 
Help Guide Privacy Policy Disclaimer Contact us
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT

Released

Journal Article

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

MPS-Authors

Chandran,  L. Sunil
Max Planck Society;

http://pubman.mpdl.mpg.de/cone/persons/resource/persons45571

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

Locator
There are no locators available
Fulltext (public)
There are no public fulltexts available
Supplementary Material (public)
There is no public supplementary material available
Citation

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.


Cite as: http://hdl.handle.net/11858/00-001M-0000-000F-2C4B-A
Abstract
There is no abstract available