Fully dynamic algorithm for chordal graphs with \(O(1)\) query-time and \(O(n^2)\) update-time (Q442287): Difference between revisions

@@ Property / DOI @@
-.1016/j.tcs.2012.05.002
@@ Property / DOI: 10.1016/j.tcs.2012.05.002 / rank @@
-Normal rank
@@ Property / Mathematics Subject Classification ID @@
+R10
@@ Property / Mathematics Subject Classification ID: 68R10 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+P05
@@ Property / Mathematics Subject Classification ID: 68P05 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+C39
@@ Property / Mathematics Subject Classification ID: 90C39 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+W05
@@ Property / Mathematics Subject Classification ID: 68W05 / rank @@
+Normal rank
@@ Property / zbMATH DE Number @@
+6064621
@@ Property / zbMATH DE Number: 6064621 / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+chordal graphs
@@ Property / zbMATH Keywords: chordal graphs / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+dynamic algorithms
@@ Property / zbMATH Keywords: dynamic algorithms / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+minimal triangulations
@@ Property / zbMATH Keywords: minimal triangulations / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.tcs.2012.05.002
+Normal rank
@@ Property / OpenAlex ID @@
+W311575298
@@ Property / OpenAlex ID: W311575298 / rank @@
+Normal rank
@@ Property / cites work @@
+A sufficiently fast algorithm for finding close to optimal clique trees
+Normal rank
@@ Property / cites work @@
+On the Desirability of Acyclic Database Schemes
@@ Property / cites work: On the Desirability of Acyclic Database Schemes / rank @@
+Normal rank
@@ Property / cites work @@
+Maximum cardinality search for computing minimal triangulations of graphs
+Normal rank
@@ Property / cites work @@
+A wide-range algorithm for minimal triangulation from an arbitrary ordering
+Normal rank
@@ Property / cites work @@
+Graph-Theoretic Concepts in Computer Science
@@ Property / cites work: Graph-Theoretic Concepts in Computer Science / rank @@
+Normal rank
@@ Property / cites work @@
+A practical algorithm for making filled graphs minimal
+Normal rank
@@ Property / cites work @@
+Q4288578
@@ Property / cites work: Q4288578 / rank @@
+Normal rank
@@ Property / cites work @@
+On rigid circuit graphs
@@ Property / cites work: On rigid circuit graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Degrees of acyclicity for hypergraphs and relational database schemes
+Normal rank
@@ Property / cites work @@
+The Evolution of the Minimum Degree Ordering Algorithm
+Normal rank
@@ Property / cites work @@
+Minimal triangulations of graphs: a survey
@@ Property / cites work: Minimal triangulations of graphs: a survey / rank @@
+Normal rank
@@ Property / cites work @@
+Fast Computation of Minimal Fill Inside A Given Elimination Ordering
+Normal rank
@@ Property / cites work @@
+Computing Minimal Triangulations in Time O(nalpha log n) = o(n2.376)
+Normal rank
@@ Property / cites work @@
+Fully dynamic algorithms for chordal graphs and split graphs
+Normal rank
@@ Property / cites work @@
+On Information and Sufficiency
@@ Property / cites work: On Information and Sufficiency / rank @@
+Normal rank
@@ Property / cites work @@
+Modification of the minimum-degree algorithm by multiple elimination
+Normal rank
@@ Property / cites work @@
+Existence of extensions and product extensions for discrete probability distributions
+Normal rank
@@ Property / cites work @@
+Fast minimal triangulation algorithm using minimum degree criterion
+Normal rank
@@ Property / cites work @@
+Simple algorithms for minimal triangulation of a graph and backward selection of a decomposable Markov network
+Normal rank
@@ Property / cites work @@
+Algorithmic Aspects of Vertex Elimination on Graphs
+Normal rank
@@ Property / cites work @@
+Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs
+Normal rank
@@ Property / cites work @@
+Computing the Minimum Fill-In is NP-Complete
@@ Property / cites work: Computing the Minimum Fill-In is NP-Complete / rank @@
+Normal rank
@@ Property / DOI @@
+.1016/J.TCS.2012.05.002
@@ Property / DOI: 10.1016/J.TCS.2012.05.002 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:442287