Umeå University's logo

umu.sePublications
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • 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
On the N best problem for hypergraphs
Umeå University, Faculty of Science and Technology, Department of Computing Science. (Natural and Formal Languages)
Umeå University, Faculty of Science and Technology, Department of Computing Science. (Natural and Formal Languages)ORCID iD: 0000-0001-7349-7693
Umeå University, Faculty of Science and Technology, Department of Computing Science. (Natural and Formal Languages)
2016 (English)In: / [ed] A. Maletti, 2016Conference paper, Oral presentation only (Other academic)
Abstract [en]

We propose an algorithm for computing the $N$ best roots of a weighted hypergraph, in which the weight function is given over an idempotent and multiplicatively monotone semiring. We give a set of conditions that ensures that the weight function is well-defined and that solutions exist. Under these conditions, we prove that the proposed algorithm is correct.  This generalizes a previous result for weighted tree automata, and in doing so, broadens the practical applications.

Place, publisher, year, edition, pages
2016.
National Category
Computer Sciences
Research subject
Computer Science
Identifiers
URN: urn:nbn:se:umu:diva-122474OAI: oai:DiVA.org:umu-122474DiVA, id: diva2:939172
Conference
Workshop on Trends in Tree Automata and Tree Transducers (TTATT 2016), Seoul, South Korea, July 18, 2016
Available from: 2016-06-17 Created: 2016-06-17 Last updated: 2019-06-26Bibliographically approved

Open Access in DiVA

No full text in DiVA

Authority records

Björklund, JohannaDrewes, FrankJonsson, Anna

Search in DiVA

By author/editor
Björklund, JohannaDrewes, FrankJonsson, Anna
By organisation
Department of Computing Science
Computer Sciences

Search outside of DiVA

GoogleGoogle Scholar

urn-nbn

Altmetric score

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

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • 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