A fully dynamic graph algorithm for recognizing interval graphs (Q1957648): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1007/s00453-009-9291-6
+Normal rank
@@ Property / OpenAlex ID @@
+W2136895095
@@ Property / OpenAlex ID: W2136895095 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4288578
@@ Property / cites work: Q4288578 / rank @@
+Normal rank
@@ Property / cites work @@
+Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
+Normal rank
@@ Property / cites work @@
+Graph Classes: A Survey
@@ Property / cites work: Graph Classes: A Survey / rank @@
+Normal rank
@@ Property / cites work @@
+Simple linear time recognition of unit interval graphs
+Normal rank
@@ Property / cites work @@
+Q4250178
@@ Property / cites work: Q4250178 / rank @@
+Normal rank
@@ Property / cites work @@
+Linear-Time Representation Algorithms for Proper Circular-Arc Graphs and Proper Interval Graphs
+Normal rank
@@ Property / cites work @@
+Separator-Based Sparsification II: Edge and Vertex Connectivity
+Normal rank
@@ Property / cites work @@
+Sparsification—a technique for speeding up dynamic graph algorithms
+Normal rank
@@ Property / cites work @@
+Incidence matrices and interval graphs
@@ Property / cites work: Incidence matrices and interval graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithmic graph theory and perfect graphs
@@ Property / cites work: Algorithmic graph theory and perfect graphs / rank @@
+Normal rank
@@ Property / cites work @@
+A Fully Dynamic Algorithm for Recognizing and Representing Proper Interval Graphs
+Normal rank
@@ Property / cites work @@
+Counting clique trees and computing perfect elimination schemes in parallel
+Normal rank
@@ Property / cites work @@
+Poly-logarithmic deterministic fully-dynamic algorithms for connectivity, minimum spanning tree, 2-edge, and biconnectivity
+Normal rank
@@ Property / cites work @@
+Fast and Simple Algorithms for Recognizing Chordal Comparability Graphs and Interval Graphs
+Normal rank
@@ Property / cites work @@
+The clique-separator graph for chordal graphs
@@ Property / cites work: The clique-separator graph for chordal graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Fully dynamic algorithms for chordal graphs and split graphs
+Normal rank
@@ Property / cites work @@
+A Fully Dynamic Graph Algorithm for Recognizing Proper Interval Graphs
+Normal rank
@@ Property / cites work @@
+The NP-completeness column: an ongoing guide
@@ Property / cites work: The NP-completeness column: an ongoing guide / rank @@
+Normal rank
@@ Property / cites work @@
+An Incremental Linear-Time Algorithm for Recognizing Interval Graphs
+Normal rank
@@ Property / cites work @@
+Topics in Intersection Graph Theory
@@ Property / cites work: Topics in Intersection Graph Theory / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithmic Aspects of Vertex Elimination on Graphs
+Normal rank
@@ Property / cites work @@
+Efficiency of a Good But Not Linear Set Union Algorithm
+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