Orthogonal drawings of graphs with vertex and edge labels (Q2573336): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q62042608, #quickstatements; #temporary_batch_1712111774907
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Turn-regularity and optimal area drawings of orthogonal representations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Drawing database schemas / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3154375 / 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: Numerical Experience with Lower Bounds for MIQP Branch-And-Bound / rank
 
Normal rank
Property / cites work
 
Property / cites work: Crossing Number is NP-Complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel concepts in graph theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of the Edge Label Placement problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A UNIFIED APPROACH TO AUTOMATIC LABEL PLACEMENT / rank
 
Normal rank
Property / cites work
 
Property / cites work: Drawing graphs. Methods and models / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4472290 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4501694 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4263720 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved algorithm for mixed-integer quadratic programs and a computational study / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4739657 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of orthogonal compaction / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Embedding a Graph in the Grid with the Minimum Number of Bends / rank
 
Normal rank

Revision as of 11:30, 11 June 2024

scientific article
Language Label Description Also known as
English
Orthogonal drawings of graphs with vertex and edge labels
scientific article

    Statements

    Orthogonal drawings of graphs with vertex and edge labels (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    7 November 2005
    0 references
    Graph drawing
    0 references
    Labeling
    0 references
    Orthogonal representations
    0 references
    Compaction algorithms
    0 references
    Experimental analysis
    0 references

    Identifiers

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