A simple linear-time recognition algorithm for weakly quasi-threshold graphs (Q659727): Difference between revisions

@@ Property / full work available at URL @@
-https://doi.org/10.1007/s00373-010-0983-0
-Normal rank
@@ Property / OpenAlex ID @@
-W2058480081
@@ Property / OpenAlex ID: W2058480081 / rank @@
-Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/s00373-010-0983-0
+Normal rank
@@ Property / OpenAlex ID @@
+W2058480081
@@ Property / OpenAlex ID: W2058480081 / rank @@
+Normal rank
@@ Property / cites work @@
+Laplacian spectrum of weakly quasi-threshold graphs
+Normal rank
@@ Property / cites work @@
+A Simple Linear Time LexBFS Cograph Recognition Algorithm
+Normal rank
@@ Property / cites work @@
+Graph Classes: A Survey
@@ Property / cites work: Graph Classes: A Survey / rank @@
+Normal rank
@@ Property / cites work @@
+Complement reducible graphs
@@ Property / cites work: Complement reducible graphs / rank @@
+Normal rank
@@ Property / cites work @@
+A Linear Recognition Algorithm for Cographs
@@ Property / cites work: A Linear Recognition Algorithm for Cographs / 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 @@
+Characterizations for co-graphs defined by restricted NLC-width or clique-width operations
+Normal rank
@@ Property / cites work @@
+A simple linear time algorithm for cograph recognition
+Normal rank