Counting edge crossings in a 2-layered drawing (Q2390316): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.ipl.2004.05.001 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2011747057 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4422269 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Edge crossings in drawings of bipartite graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: 2-Layer Straightline Crossing Minimization: Performance of Exact and Heuristic Algorithms / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Graph Drawing and Applications for Software and Knowledge Engineers / rank | |||
Normal rank | |||
Latest revision as of 20:02, 1 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Counting edge crossings in a 2-layered drawing |
scientific article |
Statements
Counting edge crossings in a 2-layered drawing (English)
0 references
21 July 2009
0 references
graph algorithms
0 references
edge crossings
0 references
bipartite graphs
0 references
counting
0 references
graph drawing
0 references
dynamic programming
0 references
divide-and-conquer
0 references
0 references
