Edge crossings in drawings of bipartite graphs (Q1322570): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / Wikidata QID
 
Property / Wikidata QID: Q56621900 / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4091421 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3785966 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3138899 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3097395 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3731621 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3985344 / 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: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Crossing Number is NP-Complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: DAG—a program that draws directed graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fundamentals of planar ordered sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Analysis of Several Heuristics for the Traveling Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4014632 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Crossing Theory and Hierarchy Mapping / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 15:38, 22 May 2024

scientific article
Language Label Description Also known as
English
Edge crossings in drawings of bipartite graphs
scientific article

    Statements

    Edge crossings in drawings of bipartite graphs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    5 May 1994
    0 references
    0 references
    0 references
    0 references
    0 references
    directed graph
    0 references
    edge crossing
    0 references
    drawing algorithms
    0 references
    bipartite graph
    0 references
    median
    0 references
    0 references