Computing Maximum C-Planar Subgraphs (Q3611845): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Efficient Extraction of Multiple Kuratowski Subdivisions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Completely connected clustered graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph Drawing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3839007 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3043705 / 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: An experimental comparison of four graph drawing algorithms. / 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: Clustered Planarity: Small Clusters in Eulerian Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximum planar subgraphs and nice embeddings: Practical layout tools / rank
 
Normal rank
Property / cites work
 
Property / cites work: The ABACUS system for branch-and-cut-and-price algorithms in integer programming and combinatorial optimization / rank
 
Normal rank

Latest revision as of 03:26, 29 June 2024

scientific article
Language Label Description Also known as
English
Computing Maximum C-Planar Subgraphs
scientific article

    Statements

    Computing Maximum C-Planar Subgraphs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    3 March 2009
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references