Optimal Partition of a Bipartite Graph with Prescribed Layout into Non-Crossing b-Matchings (Q3439389): Difference between revisions

@@ Property / cites work @@
+Q4398377
@@ Property / cites work: Q4398377 / rank @@
+Normal rank
@@ Property / cites work @@
+On the pagenumber of complete bipartite graphs
@@ Property / cites work: On the pagenumber of complete bipartite graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Graphs with E Edges Have Pagenumber O(√E)
@@ Property / cites work: Graphs with E Edges Have Pagenumber O(√E) / rank @@
+Normal rank
@@ Property / cites work @@
+Optimal partition of a bipartite graph into non-crossing matchings
+Normal rank
@@ Property / cites work @@
+Efficient labelling algorithms for the maximum noncrossing matching problem
+Normal rank
@@ Property / cites work @@
+Bounded ordered dictionaries in O(log log N) time and O(n) space
+Normal rank
@@ Property / cites work @@
+Pagenumber of complete bipartite graphs
@@ Property / cites work: Pagenumber of complete bipartite graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Preserving order in a forest in less than logarithmic time and linear space
+Normal rank
@@ Property / cites work @@
+Degree constrained book embeddings
@@ Property / cites work: Degree constrained book embeddings / rank @@
+Normal rank