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

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Erkki Maekinen / rank
Normal rank
 
Property / author
 
Property / author: Erkki Maekinen / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Genocop / rank
 
Normal rank
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.1080/00207169408804322 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1971156580 / rank
 
Normal rank
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 16: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