Pages that link to "Item:Q1322570"
From MaRDI portal
The following pages link to Edge crossings in drawings of bipartite graphs (Q1322570):
Displaying 50 items.
- 2-layer right angle crossing drawings (Q476445) (← links)
- A fast and simple subexponential fixed parameter algorithm for one-sided crossing minimization (Q494803) (← links)
- Algorithms for multi-level graph planarity testing and layout (Q596102) (← links)
- Curve-constrained drawings of planar graphs (Q706719) (← links)
- Generalized \(k\)-ary tanglegrams on level graphs: a satisfiability-based approach and its evaluation (Q714020) (← links)
- A linear edge kernel for two-layer crossing minimization (Q744090) (← links)
- Complex systems: features, similarity and connectivity (Q823211) (← links)
- Fixed parameter algorithms for one-sided crossing minimization revisited (Q935846) (← links)
- A branch-and-cut approach to the crossing number problem (Q951113) (← links)
- On the parameterized complexity of layered graph drawing (Q958215) (← links)
- Crossing minimization in extended level drawings of graphs (Q968125) (← links)
- Human-guided search (Q972653) (← links)
- Comparing trees via crossing minimization (Q988574) (← links)
- On the complexity of crossings in permutations (Q1011761) (← links)
- Edges and switches, tunnels and bridges (Q1028235) (← links)
- Crossing minimization in weighted bipartite graphs (Q1044030) (← links)
- Bubblesearch: a simple heuristic for improving priority-based greedy algorithms (Q1045924) (← links)
- A branch and bound algorithm for minimizing the number of crossing arcs in bipartite graphs (Q1266546) (← links)
- Drawing graphs in two layers (Q1331939) (← links)
- The Gifi system of descriptive multivariate analysis. (Q1431150) (← links)
- A new lower bound for the bipartite crossing number with applications (Q1575746) (← links)
- A tabu search algorithm for the bipartite drawing problem (Q1609918) (← links)
- A heuristic approach towards drawings of graphs with high crossing resolution (Q1725757) (← links)
- Algorithms and bounds for drawing directed graphs (Q1725793) (← links)
- Track layouts, layered path decompositions, and leveled planarity (Q1739109) (← links)
- On the one-sided crossing minimization in a bipartite graph with large degrees (Q1770400) (← links)
- Heuristics and meta-heuristics for 2-layer straight line crossing minimization (Q1811085) (← links)
- New bounds on the barycenter heuristic for bipartite graph drawing. (Q1853018) (← links)
- Drawings of graphs on surfaces with few crossings (Q1920424) (← links)
- Making a graph crossing-critical by multiplying its edges (Q1953450) (← links)
- On the computational complexity of edge concentration (Q1975372) (← links)
- Hybridizing simulated annealing with variable neighborhood search for bipartite graph crossing minimization (Q2008804) (← links)
- PLANET: a radial layout algorithm for network visualization (Q2164832) (← links)
- The slotted online one-sided crossing minimization problem on 2-regular graphs (Q2169959) (← links)
- Counting edge crossings in a 2-layered drawing (Q2390316) (← links)
- Drawing (complete) binary tanglegrams (Q2428677) (← links)
- Crossing-constrained hierarchical drawings (Q2458930) (← links)
- Minimizing crossings in hierarchical digraphs with a hybridized genetic algorithm (Q2491331) (← links)
- On bipartite drawings and the linear arrangement problem (Q2706134) (← links)
- Track Layout Is Hard (Q2961541) (← links)
- Ranking and Drawing in Subexponential Time (Q3000521) (← links)
- A Satisfiability-Based Approach for Embedding Generalized Tanglegrams on Level Graphs (Q3007679) (← links)
- k-Level Crossing Minimization Is NP-Hard for Trees (Q3078383) (← links)
- Simple and Efficient Bilayer Cross Counting (Q3378492) (← links)
- Drawing Bipartite Graphs on Two Curves (Q3595484) (← links)
- Bipartite Graph Representation of Multiple Decision Table Classifiers (Q3646117) (← links)
- 2-Layer Straightline Crossing Minimization: Performance of Exact and Heuristic Algorithms (Q4381060) (← links)
- Experimental studies on graph drawing algorithms (Q4789076) (← links)
- Genetic algorithms for drawing bipartite graphs (Q4844579) (← links)
- Right Angle Crossing Drawings of Graphs (Q5001661) (← links)
