Finding the \(N\) best vertices in an infinite weighted hypergraph

DOI10.1016/j.tcs.2017.03.010zbMath1371.05197OpenAlexW2597845656MaRDI QIDQ2358678

Johanna Björklund, Frank Drewes, Anna Jonsson

Publication date: 15 June 2017

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2017.03.010

zbMATH Keywords

hypergraphidempotent semiring\(N\)-best problem

Mathematics Subject Classification ID

Hypergraphs (05C65) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Graph algorithms (graph-theoretic aspects) (05C85) Signed and weighted graphs (05C22)

Cites Work

• A generalization of Dijkstra's algorithm
• Grammatical picture generation. A tree-based approach. With CD-ROM.
• An Efficient Best-Trees Algorithm for Weighted Tree Automata over the Tropical Semiring
• Unnamed Item

This page was built for publication: Finding the \(N\) best vertices in an infinite weighted hypergraph