Linear Algorithms for Chordal Graphs of Bounded Directed Vertex Leafage (Q2839217): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.endm.2009.02.014
+Normal rank
@@ Property / OpenAlex ID @@
+W2070719150
@@ Property / OpenAlex ID: W2070719150 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4508365
@@ Property / cites work: Q4508365 / 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 @@
+A linear-time algorithm for a special case of disjoint set union
+Normal rank
@@ Property / cites work @@
+The intersection graphs of subtrees in trees are exactly the chordal graphs
+Normal rank
@@ Property / cites work @@
+A recognition algorithm for the intersection graphs of directed paths in directed trees
+Normal rank
@@ Property / cites work @@
+Q3328583
@@ Property / cites work: Q3328583 / rank @@
+Normal rank
@@ Property / cites work @@
+An Optimal Solution for the Channel-Assignment Problem
+Normal rank
@@ Property / cites work @@
+The leafage of a chordal graph
@@ Property / cites work: The leafage of a chordal graph / rank @@
+Normal rank
@@ Property / cites work @@
+Representing triangulated graphs in stars
@@ Property / cites work: Representing triangulated graphs in stars / rank @@
+Normal rank
@@ Property / cites work @@
+A faster algorithm to recognize undirected path graphs
+Normal rank
@@ Property / cites work @@
+Efficient graph representations
@@ Property / cites work: Efficient graph representations / rank @@
+Normal rank