liu.seSearch for publications in DiVA
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
An Algorithm for Counting Maximum Weighted Independent Sets and its Applications
Linköping University, Department of Computer and Information Science, TCSLAB - Theoretical Computer Science Laboratory. Linköping University, The Institute of Technology.
Linköping University, Department of Computer and Information Science, TCSLAB - Theoretical Computer Science Laboratory. Linköping University, The Institute of Technology.
2002 (English)In: Proc. of the 13th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-2002), ACM-SIAM , 2002Conference paper, Published paper (Refereed)
Place, publisher, year, edition, pages
ACM-SIAM , 2002.
National Category
Engineering and Technology
Identifiers
URN: urn:nbn:se:liu:diva-61722OAI: oai:DiVA.org:liu-61722DiVA: diva2:370717
Available from: 2010-11-17 Created: 2010-11-17 Last updated: 2017-02-23

Open Access in DiVA

No full text

Authority records BETA

Dahllöf, VilhelmJonsson, Peter

Search in DiVA

By author/editor
Dahllöf, VilhelmJonsson, Peter
By organisation
TCSLAB - Theoretical Computer Science LaboratoryThe Institute of Technology
Engineering and Technology

Search outside of DiVA

GoogleGoogle Scholar

urn-nbn

Altmetric score

urn-nbn
Total: 42 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf