Computing the Overlaps of Two Maps (Q2815189): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
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.1007/978-3-319-39441-1_7 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2476025250 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial Maps / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4071773 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Polynomial Algorithm for Submap Isomorphism / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial algorithms for open plane graph and subgraph isomorphisms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Planar Subgraph Isomorphism Revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: Subgraph Isomorphism in Planar Graphs and Related Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Complexity of Submap Isomorphism / rank
 
Normal rank
Property / cites work
 
Property / cites work: Planar Formulae and Their Uses / rank
 
Normal rank

Latest revision as of 05:30, 12 July 2024

scientific article
Language Label Description Also known as
English
Computing the Overlaps of Two Maps
scientific article

    Statements

    Computing the Overlaps of Two Maps (English)
    0 references
    27 June 2016
    0 references
    2D semi-open combinatorial maps
    0 references
    overlaps
    0 references
    overlapping patterns
    0 references
    product map
    0 references

    Identifiers