A simple linear time certifying LBFS-based algorithm for recognizing trivially perfect graphs and their complements (Q963386): Difference between revisions

@@ 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.ipl.2007.12.009
+Normal rank
@@ Property / OpenAlex ID @@
+W2089241552
@@ Property / OpenAlex ID: W2089241552 / rank @@
+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 @@
+Graph-Theoretic Concepts in Computer Science
@@ Property / cites work: Graph-Theoretic Concepts in Computer Science / rank @@
+Normal rank
@@ Property / cites work @@
+Trivially perfect graphs
@@ Property / cites work: Trivially perfect graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Lex-BFS and partition refinement, with applications to transitive orientation, interval graph recognition and consecutive ones testing
+Normal rank
@@ Property / cites work @@
+Q3203054
@@ Property / cites work: Q3203054 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4161356
@@ Property / cites work: Q4161356 / rank @@
+Normal rank
@@ Property / cites work @@
+The Comparability Graph of a Tree
@@ Property / cites work: The Comparability Graph of a Tree / rank @@
+Normal rank
@@ Property / cites work @@
+Quasi-threshold graphs
@@ Property / cites work: Quasi-threshold graphs / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:963386