A vertex incremental approach for maintaining chordality (Q819824): Difference between revisions

@@ Property / DOI @@
-.1016/j.disc.2005.12.002
@@ Property / DOI: 10.1016/j.disc.2005.12.002 / 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.disc.2005.12.002
+Normal rank
@@ Property / OpenAlex ID @@
+W2064246684
@@ Property / OpenAlex ID: W2064246684 / rank @@
+Normal rank
@@ Property / cites work @@
+An efficient algorithm for finding a two-pair, and its applications
+Normal rank
@@ Property / cites work @@
+A fast algorithm for finding an edge-maximal subgraph with a TR-formative coloring
+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 @@
+Q4252378
@@ Property / cites work: Q4252378 / rank @@
+Normal rank
@@ Property / cites work @@
+Maximum cardinality search for computing minimal triangulations of graphs
+Normal rank
@@ Property / cites work @@
+Q2708230
@@ Property / cites work: Q2708230 / rank @@
+Normal rank
@@ Property / cites work @@
+A wide-range algorithm for minimal triangulation from an arbitrary ordering
+Normal rank
@@ Property / cites work @@
+Maximal sub-triangulation in pre-processing phylogenetic data
+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 @@
+The Pathwidth and Treewidth of Cographs
@@ Property / cites work: The Pathwidth and Treewidth of Cographs / rank @@
+Normal rank
@@ Property / cites work @@
+A characterisation of rigid circuit graphs
@@ Property / cites work: A characterisation of rigid circuit graphs / rank @@
+Normal rank
@@ Property / cites work @@
+A chordal preconditioner for large-scale optimization
+Normal rank
@@ Property / cites work @@
+Q4373676
@@ Property / cites work: Q4373676 / rank @@
+Normal rank
@@ Property / cites work @@
+Maximal chordal subgraphs
@@ Property / cites work: Maximal chordal subgraphs / rank @@
+Normal rank
@@ Property / cites work @@
+On rigid circuit graphs
@@ Property / cites work: On rigid circuit graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q3317132
@@ Property / cites work: Q3317132 / rank @@
+Normal rank
@@ Property / cites work @@
+Incidence matrices and interval graphs
@@ Property / cites work: Incidence matrices and interval graphs / rank @@
+Normal rank
@@ Property / cites work @@
+The intersection graphs of subtrees in trees are exactly the chordal graphs
+Normal rank
@@ Property / cites work @@
+Generating weakly triangulated graphs
@@ Property / cites work: Generating weakly triangulated graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Optimizing weakly triangulated graphs
@@ Property / cites work: Optimizing weakly triangulated graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q4952597
@@ Property / cites work: Q4952597 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4411390
@@ Property / cites work: Q4411390 / rank @@
+Normal rank
@@ Property / cites work @@
+Counting clique trees and computing perfect elimination schemes in parallel
+Normal rank
@@ Property / cites work @@
+Q4252412
@@ Property / cites work: Q4252412 / rank @@
+Normal rank
@@ Property / cites work @@
+Complexity classification of some edge modification problems
+Normal rank
@@ Property / cites work @@
+Q5683627
@@ Property / cites work: Q5683627 / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithmic Aspects of Vertex Elimination on Graphs
+Normal rank
@@ Property / cites work @@
+Algorithms for weakly triangulated graphs
@@ Property / cites work: Algorithms for weakly triangulated graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Edge‐maximal triangulated subgraphs and heuristics for the maximum clique problem
+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.DISC.2005.12.002
@@ Property / DOI: 10.1016/J.DISC.2005.12.002 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:819824