Two-layer drawings of bipartite graphs (Q1689940): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.endm.2017.06.059 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2743581564 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recognition and complexity of point visibility graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Drawing graphs in two layers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Crossing-constrained hierarchical drawings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic graph theory and perfect graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: String graphs. II: Recognizing string graphs is NP-hard / rank
 
Normal rank

Latest revision as of 00:16, 15 July 2024

scientific article
Language Label Description Also known as
English
Two-layer drawings of bipartite graphs
scientific article

    Statements

    Two-layer drawings of bipartite graphs (English)
    0 references
    0 references
    0 references
    0 references
    18 January 2018
    0 references
    0 references
    0 references
    0 references
    0 references
    abstract topological graph
    0 references
    two-layer drawing
    0 references
    bipartite graph
    0 references
    0 references