Planarity of streamed graphs (Q2333805): Difference between revisions

From MaRDI portal
Changed an Item
Created claim: DBLP publication ID (P1635): conf/ciac/LozzoR15, #quickstatements; #temporary_batch_1731530891435
 
(7 intermediate revisions by 5 users not shown)
aliases / en / 0aliases / en / 0
 
Planarity of Streamed Graphs
description / endescription / en
scientific article
scientific article; zbMATH DE number 6483719
Property / title
 
Planarity of Streamed Graphs (English)
Property / title: Planarity of Streamed Graphs (English) / rank
 
Normal rank
Property / zbMATH Open document ID
 
Property / zbMATH Open document ID: 1436.68230 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/978-3-319-18173-8_11 / rank
 
Normal rank
Property / published in
 
Property / published in: Lecture Notes in Computer Science / rank
 
Normal rank
Property / publication date
 
21 September 2015
Timestamp+2015-09-21T00:00:00Z
Timezone+00:00
CalendarGregorian
Precision1 day
Before0
After0
Property / publication date: 21 September 2015 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6483719 / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W4206638026 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2167450452 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1501.07106 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q62046553 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Drawing Non-Planar Graphs with Crossing-Free Subgraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Advancements on SEFE and partitioned book embedding problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Testing the simultaneous embeddability of two graphs whose intersection is a biconnected or a connected graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simultaneous embedding: edge orderings, relative positions, cutvertices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Drawing trees in a streaming model / rank
 
Normal rank
Property / cites work
 
Property / cites work: Planarity of streamed graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3154375 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On-Line Planarity Testing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simultaneous Graph Embeddings with Fixed Edges / rank
 
Normal rank
Property / cites work
 
Property / cites work: Picking Planar Edges; or, Drawing a Graph with a Planar Subgraph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recognizing string graphs in NP / rank
 
Normal rank
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

Latest 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
  • Planarity of Streamed Graphs

Statements

Planarity of streamed graphs (English)
0 references
Planarity of Streamed Graphs (English)
0 references
0 references
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

Identifiers

0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references