On finding optimal polytrees (Q500966): Difference between revisions

@@ Property / Mathematics Subject Classification ID @@
+R10
@@ Property / Mathematics Subject Classification ID: 68R10 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+B35
@@ Property / Mathematics Subject Classification ID: 05B35 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+Q17
@@ Property / Mathematics Subject Classification ID: 68Q17 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+Q25
@@ Property / Mathematics Subject Classification ID: 68Q25 / rank @@
+Normal rank
@@ Property / zbMATH DE Number @@
+6492042
@@ Property / zbMATH DE Number: 6492042 / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+directed acyclic graphs
@@ Property / zbMATH Keywords: directed acyclic graphs / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+branchings
@@ Property / zbMATH Keywords: branchings / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+polytrees
@@ Property / zbMATH Keywords: polytrees / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+parameterized complexity
@@ Property / zbMATH Keywords: parameterized complexity / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+matroids
@@ Property / zbMATH Keywords: matroids / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+probabilistic networks
@@ Property / zbMATH Keywords: probabilistic networks / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W2563028924
@@ Property / OpenAlex ID: W2563028924 / rank @@
+Normal rank
@@ Property / arXiv ID @@
+.1692
@@ Property / arXiv ID: 1208.1692 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5645231
@@ Property / cites work: Q5645231 / rank @@
+Normal rank
@@ Property / cites work @@
+Two algorithms for weighted matroid intersection
@@ Property / cites work: Two algorithms for weighted matroid intersection / rank @@
+Normal rank
@@ Property / cites work @@
+A note on finding optimum branchings
@@ Property / cites work: A note on finding optimum branchings / rank @@
+Normal rank
@@ Property / cites work @@
+Q5567717
@@ Property / cites work: Q5567717 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4393480
@@ Property / cites work: Q4393480 / rank @@
+Normal rank
@@ Property / cites work @@
+Optimum branchings
@@ Property / cites work: Optimum branchings / rank @@
+Normal rank
@@ Property / cites work @@
+Q5684698
@@ Property / cites work: Q5684698 / rank @@
+Normal rank
@@ Property / cites work @@
+Matroid Intersection
@@ Property / cites work: Matroid Intersection / rank @@
+Normal rank
@@ Property / cites work @@
+Parametrized complexity theory.
@@ Property / cites work: Parametrized complexity theory. / rank @@
+Normal rank
@@ Property / cites work @@
+Exact exponential algorithms.
@@ Property / cites work: Exact exponential algorithms. / rank @@
+Normal rank
@@ Property / cites work @@
+A weighted matroid intersection algorithm
@@ Property / cites work: A weighted matroid intersection algorithm / rank @@
+Normal rank
@@ Property / cites work @@
+Bayesian network classifiers
@@ Property / cites work: Bayesian network classifiers / rank @@
+Normal rank
@@ Property / cites work @@
+Packing rooted directed cuts in a weighted directed graph
+Normal rank
@@ Property / cites work @@
+Efficient algorithms for finding minimum spanning trees in undirected and directed graphs
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+On finding optimal polytrees
@@ Property / cites work: On finding optimal polytrees / rank @@
+Normal rank
@@ Property / cites work @@
+Learning Bayesian networks: The combination of knowledge and statistical data
+Normal rank
@@ Property / cites work @@
+Which problems have strongly exponential complexity?
+Normal rank
@@ Property / cites work @@
+AN ALGORITHM FOR FINDING AN OPTIMAL "INDEPENDENT ASSIGNMENT"
+Normal rank
@@ Property / cites work @@
+A simple derivation of edmonds' algorithm for optimum branchings
+Normal rank
@@ Property / cites work @@
+Q3093195
@@ Property / cites work: Q3093195 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4130999
@@ Property / cites work: Q4130999 / rank @@
+Normal rank
@@ Property / cites work @@
+Parameterized Complexity Results for Exact Bayesian Network Structure Learning
+Normal rank
@@ Property / cites work @@
+On the parameterized complexity of the fixed alphabet shortest common supersequence and longest common subsequence problems
+Normal rank
@@ Property / cites work @@
+Finding optimum branchings
@@ Property / cites work: Finding optimum branchings / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:500966