A framework and algorithms for circular drawings of graphs (Q2465996): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an 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.1016/j.jda.2005.01.009 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2031944610 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for drawing graphs: An annotated bibliography / 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: Q4853751 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph graphics: Theory and practice / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear algorithms to recognize outerplanar and maximal outerplanar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3992847 / rank
 
Normal rank

Latest revision as of 15:02, 27 June 2024

scientific article
Language Label Description Also known as
English
A framework and algorithms for circular drawings of graphs
scientific article

    Statements

    A framework and algorithms for circular drawings of graphs (English)
    0 references
    0 references
    0 references
    11 January 2008
    0 references
    0 references
    0 references
    0 references
    0 references
    circular graph drawing
    0 references
    graph drawing
    0 references
    information visualization
    0 references
    network visualization
    0 references
    clustered views
    0 references
    minimization of crossings
    0 references
    experimental studies
    0 references
    0 references