Planarity of streamed graphs (Q2333805): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Created claim: DBLP publication ID (P1635): conf/ciac/LozzoR15, #quickstatements; #temporary_batch_1731530891435 |
||
| (One intermediate revision by one other user not shown) | |||
| Property / cites work | |||
| Property / cites work: Algorithms and bounds for drawing non-planar graphs with crossing-free subgraphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A linear-time algorithm for a special case of disjoint set union / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Fast Algorithms for Finding Nearest Common Ancestors / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: String graphs. II: Recognizing string graphs is NP-hard / rank | |||
Normal rank | |||
| Property / DBLP publication ID | |||
| Property / DBLP publication ID: conf/ciac/LozzoR15 / rank | |||
Normal rank | |||
Revision as of 22:16, 13 November 2024
scientific article; zbMATH DE number 6483719
- Planarity of Streamed Graphs
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Planarity of streamed graphs |
scientific article; zbMATH DE number 6483719 |
|
Statements
Planarity of streamed graphs (English)
0 references
Planarity of Streamed Graphs (English)
0 references
13 November 2019
0 references
21 September 2015
0 references
planarity
0 references
simultaneous embeddings
0 references
graph drawing
0 references
streamed graphs
0 references
0 references
