Locating the eigenvalues for graphs of small clique-width

Martin Fürer, Carlos Hoppen, David P. Jacobs, Vilmar Trevisan

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Scopus citations

Abstract

It is shown that if G has clique-width k, and a corresponding tree decomposition is known, then a diagonal matrix congruent to A- cI for constants c, where A is the adjacency matrix of the graph G of order n, can be computed in time O(k2n). This allows to quickly tell the number of eigenvalues in a given interval.

Original languageEnglish (US)
Title of host publicationLATIN 2018
Subtitle of host publicationTheoretical Informatics - 13th Latin American Symposium, Proceedings
EditorsMiguel A. Mosteiro, Michael A. Bender, Martin Farach-Colton
PublisherSpringer Verlag
Pages475-489
Number of pages15
ISBN (Print)9783319774039
DOIs
StatePublished - Jan 1 2018
Event13th International Symposium on Latin American Theoretical Informatics, LATIN 2018 - Buenos Aires, Argentina
Duration: Apr 16 2018Apr 19 2018

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume10807 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other13th International Symposium on Latin American Theoretical Informatics, LATIN 2018
CountryArgentina
CityBuenos Aires
Period4/16/184/19/18

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'Locating the eigenvalues for graphs of small clique-width'. Together they form a unique fingerprint.

Cite this