Clustered Planarity: Clusters with Few Outgoing Edges (Q3611843): 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.1007/978-3-642-00219-9_11 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1496931397 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Completely connected clustered graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Clustering Cycles into Cycles of Clusters / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3839007 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient C-Planarity Testing for Embedded Flat Clustered Graphs with Small Faces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Straight-line drawing algorithms for hierarchical graphs and clustered graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Planarity for clustered graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph Drawing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4422278 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph-Theoretic Concepts in Computer Science / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Planarity Testing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Clustered Planarity: Small Clusters in Eulerian Graphs / rank
 
Normal rank

Latest revision as of 02:26, 29 June 2024

scientific article
Language Label Description Also known as
English
Clustered Planarity: Clusters with Few Outgoing Edges
scientific article

    Statements

    Identifiers