Pages that link to "Item:Q5710814"
From MaRDI portal
The following pages link to Graph-Theoretic Concepts in Computer Science (Q5710814):
Displaying 17 items.
- Circular right-angle crossing drawings in linear time (Q301590) (← links)
- Complex systems: features, similarity and connectivity (Q823211) (← links)
- Crossing minimization in extended level drawings of graphs (Q968125) (← links)
- An improved force-directed graph layout algorithm based on aesthetic criteria (Q1685035) (← links)
- Stack-number is not bounded by queue-number (Q2151179) (← links)
- Fixed-parameter tractability for book drawing with bounded number of crossings per edge (Q2151389) (← links)
- An annotated bibliography on 1-planarity (Q2407041) (← links)
- The Bundled Crossing Number (Q2961534) (← links)
- Crossing Minimisation Heuristics for 2-page Drawings (Q3439393) (← links)
- Visual Analysis of One-to-Many Matched Graphs (Q3611847) (← links)
- Group-Level Analysis and Visualization of Social Networks (Q3637326) (← links)
- The Turing Test for Graph Drawing Algorithms (Q5014138) (← links)
- (Q5111885) (← links)
- (Q5115821) (← links)
- Multi-circular Layout of Micro/Macro Graphs (Q5452229) (← links)
- On 3-coloring circle graphs (Q6560146) (← links)
- On 3-coloring circle graphs (Q6636987) (← links)
