Crossing-constrained hierarchical drawings (Q2458930): 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.jda.2005.06.001
+Normal rank
@@ Property / OpenAlex ID @@
+W1965325552
@@ Property / OpenAlex ID: W1965325552 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4258216
@@ Property / cites work: Q4258216 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3138899
@@ Property / cites work: Q3138899 / 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 @@
+Width-restricted layering of acyclic digraphs with consideration of dummy nodes
+Normal rank
@@ Property / cites work @@
+Q3154375
@@ Property / cites work: Q3154375 / rank @@
+Normal rank
@@ Property / cites work @@
+Drawing graphs in two layers
@@ Property / cites work: Drawing graphs in two layers / 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 @@
+Q4551375
@@ Property / cites work: Q4551375 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / 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 @@
+Approximations for the maximum acyclic subgraph problem
+Normal rank
@@ Property / cites work @@
+Efficient Planarity Testing
@@ Property / cites work: Efficient Planarity Testing / rank @@
+Normal rank
@@ Property / cites work @@
+-Layer Straightline Crossing Minimization: Performance of Exact and Heuristic Algorithms
+Normal rank
@@ Property / cites work @@
+Graph drawing software
@@ Property / cites work: Graph drawing software / rank @@
+Normal rank
@@ Property / cites work @@
+String graphs. II: Recognizing string graphs is NP-hard
+Normal rank
@@ Property / cites work @@
+Noncrossing Subgraphs in Topological Layouts
@@ Property / cites work: Noncrossing Subgraphs in Topological Layouts / rank @@
+Normal rank
@@ Property / cites work @@
+Q4702944
@@ Property / cites work: Q4702944 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3043710
@@ Property / cites work: Q3043710 / rank @@
+Normal rank
@@ Property / cites work @@
+Total Ordering Problem
@@ Property / cites work: Total Ordering Problem / rank @@
+Normal rank
@@ Property / cites work @@
+Q3043722
@@ Property / cites work: Q3043722 / rank @@
+Normal rank
@@ Property / cites work @@
+Recognizing string graphs in NP
@@ Property / cites work: Recognizing string graphs in NP / rank @@
+Normal rank
@@ Property / cites work @@
+Decidability of string graphs
@@ Property / cites work: Decidability of string graphs / 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 @@
+Q2764046
@@ Property / cites work: Q2764046 / rank @@
+Normal rank