Hypergraph planarity and the complexity of drawing venn diagrams (Q3800081): 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: David S. Johnson / rank
Normal rank
 
Property / author
 
Property / author: David S. Johnson / 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.1002/jgt.3190110306 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2153718046 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q56171393 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Desirability of Acyclic Database Schemes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Planarity Testing / rank
 
Normal rank

Latest revision as of 17:50, 18 June 2024

scientific article
Language Label Description Also known as
English
Hypergraph planarity and the complexity of drawing venn diagrams
scientific article

    Statements

    Hypergraph planarity and the complexity of drawing venn diagrams (English)
    0 references
    0 references
    0 references
    1987
    0 references
    vertex-planar hypergraph
    0 references
    hyperedge-planar hypergraph
    0 references

    Identifiers