Genetic algorithms for drawing bipartite graphs (Q4844579): Difference between revisions

@@ Property / MaRDI profile type @@
+Publication
@@ Property / MaRDI profile type: Publication / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1080/00207169408804322
+Normal rank
@@ Property / OpenAlex ID @@
+W1971156580
@@ Property / OpenAlex ID: W1971156580 / rank @@
+Normal rank
@@ Property / cites work @@
+Edge crossings in drawings of bipartite graphs
@@ Property / cites work: Edge crossings in drawings of bipartite graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Crossing Number is NP-Complete
@@ Property / cites work: Crossing Number is NP-Complete / rank @@
+Normal rank
@@ Property / cites work @@
+Experiments on drawing 2-level hierarchical graphs
+Normal rank
@@ Property / cites work @@
+Q4023071
@@ Property / cites work: Q4023071 / rank @@
+Normal rank
@@ Property / cites work @@
+Toward a theory of crossing numbers
@@ Property / cites work: Toward a theory of crossing numbers / rank @@
+Normal rank
@@ Property / cites work @@
+Crossing Theory and Hierarchy Mapping
@@ Property / cites work: Crossing Theory and Hierarchy Mapping / rank @@
+Normal rank
@@ Property / cites work @@
+A SPECIAL CROSSING NUMBER FOR BIPARTITE GRAPHS: A RESEARCH PROBLEM
+Normal rank