Genetic algorithms for drawing bipartite graphs (Q4844579): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Edge crossings in drawings of bipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Crossing Number is NP-Complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: Experiments on drawing 2-level hierarchical graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4023071 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Toward a theory of crossing numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Crossing Theory and Hierarchy Mapping / rank
 
Normal rank
Property / cites work
 
Property / cites work: A SPECIAL CROSSING NUMBER FOR BIPARTITE GRAPHS: A RESEARCH PROBLEM / rank
 
Normal rank

Latest revision as of 17:01, 23 May 2024

scientific article; zbMATH DE number 790916
Language Label Description Also known as
English
Genetic algorithms for drawing bipartite graphs
scientific article; zbMATH DE number 790916

    Statements

    Identifiers