Drawing \(c\)-planar biconnected clustered graphs (Q885287): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.dam.2006.04.044
+Normal rank
@@ Property / OpenAlex ID @@
+W2018796027
@@ Property / OpenAlex ID: W2018796027 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3154375
@@ Property / cites work: Q3154375 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3839007
@@ Property / cites work: Q3839007 / rank @@
+Normal rank
@@ Property / cites work @@
+Straight-line drawing algorithms for hierarchical graphs and clustered graphs
+Normal rank
@@ Property / cites work @@
+Drawing Clustered Graphs on an Orthogonal Grid
@@ Property / cites work: Drawing Clustered Graphs on an Orthogonal Grid / rank @@
+Normal rank
@@ Property / cites work @@
+Planarity for clustered graphs
@@ Property / cites work: Planarity for clustered graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q4217768
@@ Property / cites work: Q4217768 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4422278
@@ Property / cites work: Q4422278 / rank @@
+Normal rank
@@ Property / cites work @@
+Fast Algorithms for Finding Nearest Common Ancestors
+Normal rank
@@ Property / cites work @@
+Drawing graphs. Methods and models
@@ Property / cites work: Drawing graphs. Methods and models / rank @@
+Normal rank
@@ Property / cites work @@
+Planar graphs: Theory and algorithms
@@ Property / cites work: Planar graphs: Theory and algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+Q3757930
@@ Property / cites work: Q3757930 / rank @@
+Normal rank
@@ Property / cites work @@
+On Finding Lowest Common Ancestors: Simplification and Parallelization
+Normal rank
@@ Property / cites work @@
+A data structure for dynamic trees
@@ Property / cites work: A data structure for dynamic trees / rank @@
+Normal rank