scientific article; zbMATH DE number 7075879

MaRDI QIDQ4967175zbMATH OpenFDO

Authors David Eppstein

Publication date 3 July 2019

Full work available at URL https://arxiv.org/abs/1412.5075, http://bulletin.eatcs.org/index.php/beatcs/article/view/322/304

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• scientific article; zbMATH DE number 1256675
• Enumeration of K-trees and applications
• Kolmogorov complexity of enumerating finite sets
• Enumerating the \(k\) best plane spanning trees
• Enumerating k-way trees
• scientific article; zbMATH DE number 1185313
• Computing the sequence of k-cardinality assignments
• scientific article; zbMATH DE number 637317
• K-permutivity
• Publication:4729840

Cited in

(10)

• Algorithms for finding k-best perfect matchings
• An O(Kn (Kn)) algorithm for the Kth best spanning tree in series parallel graphs
• On the hardness of bribery variants in voting with CP-nets
• scientific article; zbMATH DE number 176477 (Why is no real title available?)
• scientific article; zbMATH DE number 1241393 (Why is no real title available?)
• \(k\)-best solutions of MSO problems on tree-decomposable graphs
• k-shortest simple paths in bounded treewidth graphs
• Genome assembly, from practice to theory: safe, complete and linear-time
• From amortized to worst case delay in enumeration algorithms
• On finding -th smallest perfect matchings

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4967175)